DocumentCode :
1552880
Title :
Long packing and covering codes
Author :
Cohen, Gérard ; Honkala, Iiro ; Litsyn, Simon ; Solé, Patrick
Author_Institution :
Ecole Nat. Superieure des Telecommun., Paris, France
Volume :
43
Issue :
5
fYear :
1997
fDate :
9/1/1997 12:00:00 AM
Firstpage :
1617
Lastpage :
1619
Abstract :
We study geometrically the domain of linear binary codes and of unrestricted binary codes in the plane (normalized covering radius, normalized minimal distance)
Keywords :
binary sequences; linear codes; asymptotic relations; code weights; covering codes; linear binary codes; long packing codes; normalized covering radius; normalized minimal distance; unrestricted binary codes; Binary codes; Error correction codes; H infinity control; Information theory; Mathematics; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.623161
Filename :
623161
Link To Document :
بازگشت