Abstract
In this paper we consider $K^{th}$ order zero disparity codes for $ q$-ary alphabets. We give criteria for determining the existence of codewords for a given alphabet, order and length. Obtain a lower bound on the minimum distance and show how codewords may be concatenated to form others. We also discuss a decoding procedure.
| Original language | English |
|---|---|
| Title of host publication | Codes and Cyphers |
| Subtitle of host publication | Cryptography and Coding iV |
| Editors | P.G. Farrell |
| Place of Publication | Essex |
| Publisher | IMA - Institute of Mathematics & its Applications |
| Pages | 341 |
| Number of pages | 7 |
| ISBN (Print) | 0-905091-03-5 |
| Publication status | Published - 1995 |