DocumentCode
1401847
Title
On the [162,8,80] codes
Author
Boukliev, I. ; Dodunekov, S.M. ; Helleseth, T. ; Ytrehus, ø
Author_Institution
Inst. of Math. & Inf., Bulgarian Acad. of Sci., Tarnovo, Bulgaria
Volume
43
Issue
6
fYear
1997
fDate
11/1/1997 12:00:00 AM
Firstpage
2055
Lastpage
2057
Abstract
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding the minimum length of binary codes of dimension S and minimum distances 78 and 80, respectively
Keywords
Galois fields; binary sequences; dual codes; linear codes; Galois field; [159,8,78] codes; [162,8,80] codes; code construction; minimum distance; minimum length; optimal binary codes; Computer aided software engineering; Equations; Hamming distance; Hamming weight; Informatics; Linear code; Mathematics; Polynomials; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.641576
Filename
641576
Link To Document