On the combinatorial structure of a class of shortened Hamming codes and their dual-codes
โ Scribed by M. Esmaeili; A. Zaghian
- Book ID
- 108112751
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 581 KB
- Volume
- 157
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Stinson and van Rees (Combinatorica (1984), 357-362) proved that the existence of an equidistant code E: (n = 4s + 1,d = 2s, N) with N = n implies the existence of a certain symmetrical BIB design. This result is extended here for the constant weight codes with the same n and d. A theorem on t
The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitiv