DocumentCode :
1087451
Title :
Maximum distance of anticodes
Author :
da Rocha, V.C. ; De Souza, M.M.C.
Author_Institution :
Inst. for Signal & Inf. Process., Swiss Federal Inst. of Technol., Zurich, Switzerland
Volume :
27
Issue :
17
fYear :
1991
Firstpage :
1565
Lastpage :
1566
Abstract :
Bounds on the maximum distance of anticodes are investigated. A refined version of the Plotkin lower bound on the maximum distance is presented, enabling its application to higher rate anticodes. A simplified expression for the Griesmer bound on the anticode length is derived, involving only the maximum distance subjected to a minor constraint. The minimum distance of the dual subspace is shown to be upper bounded by the anticode maximum distance. At least in the binary case this upper bound is tight and an example is provided by maximum distance anticodes and Hamming codes, which are duals and optimal.
Keywords :
codes; information theory; Griesmer bound; Hamming codes; Plotkin lower bound; anticode length; higher rate anticodes; maximum distance of anticodes;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19910980
Filename :
132830
Link To Document :
بازگشت