DocumentCode
3041117
Title
Code pairs with specified parity of the Hamming distances
Author
Ahlswede, R. ; Zhang, Z.
Author_Institution
Fak. fur Math., Bielefeld Univ., Germany
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
256
Abstract
The study of pairs of codes with mutually constant distances was initiated in Ahlswede et al. (1984) and continued in increasing generality by Delsarte, Piret, Hall, van Lint, Moers and culminated in Ahlswede et al. (1990). In another direction, in Ahlswede (1987) constant distance code pairs were analysed for specified distances and also for non-binary alphabets. There, also extremal problems with constant parity of the Hamming distance were considered. We briefly report the results and conjectures
Keywords
codes; Hamming distances; conjectures; constant distance code pairs; constant parity; extremal problems; mutually constant distances; nonbinary alphabets; specified distances; specified parity; Artificial intelligence; Combinatorial mathematics; Complexity theory; Hamming distance;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613173
Filename
613173
Link To Document