Title :
Constructions, families, and tables of binary linear covering codes
Author :
Davydov, Alexander A. ; Drozhzhina-Labvinskaya, A.Yu.
Author_Institution :
Inst. for Problems of Cybernetics, Acad. of Sci., Moscow, Russia
fDate :
7/1/1994 12:00:00 AM
Abstract :
Presents constructions and infinite families of binary linear covering codes with covering radii R=2,3,4. Using these codes, the authors obtain a table of constructive upper bounds on the length function l(r,R) for r⩽64 and R=2,3,4, where l(r, R) is the smallest length of a binary linear code with given codimension r and covering radius R. They obtain also upper bounds on l(r, R) for r=21, 28, R=5. Parameters of the constructed codes are better than parameters of previously known codes
Keywords :
binary sequences; codes; binary linear covering codes; codimension; constructions; constructive upper bounds; covering radii; infinite families; length function; Application specific processors; Combinatorial mathematics; Convolutional codes; Error correction codes; Geometry;
Journal_Title :
Information Theory, IEEE Transactions on