Geometric spaces and efficient codes (Q1904267)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Geometric spaces and efficient codes |
scientific article; zbMATH DE number 827401
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Geometric spaces and efficient codes |
scientific article; zbMATH DE number 827401 |
Statements
Geometric spaces and efficient codes (English)
0 references
24 June 1996
0 references
The theory of geometric spaces is used to construct new efficient error control codes. The emphasis is on single error correcting-double error detecting codes. Both encoding and decoding algorithms are given and analysed. A comparison is given with a shortened Hamming code to show that the new codes provide faster and less complex circuits for the whole coding process. The paper begins with a careful introduction of the basic ideas and proceeds gently to more complex considerations using several of the basic ideas of coding theory.
0 references
error detection
0 references
parallel encoding
0 references
geometric spaces
0 references
error control codes
0 references
single error correcting-double error detecting codes
0 references
encoding
0 references
decoding algorithms
0 references
0.7577970623970032
0 references
0.7461109757423401
0 references