
doi: 10.1007/bf01222864
handle: 11575/1233
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.
parallel encoding, single error correcting-double error detecting codes, Decoding, error detection, geometric spaces, encoding, decoding algorithms, error control codes, Linear codes (general theory)
parallel encoding, single error correcting-double error detecting codes, Decoding, error detection, geometric spaces, encoding, decoding algorithms, error control codes, Linear codes (general theory)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
