Paper Info
Title
Upper Bounds for the Lengths of s-Extremal Codes Over F2, F4, and F2 + uF2
Abstract
Our purpose is to find an upper bound for the length of an s-extremal code over F2 (resp. F4) when d equiv 2 (mod 4) (resp. d odd). This question is left open in [A bound for certain s -extremal lattices and codes, Archiv der Mathematik, vol. 89, no. 2, pp. 143-151, 2007] (resp. [s-extremal additive F4 codes, Advances in Mathematics of Communications, vol. 1, no. 1, pp. 111-130,2007]). More precis...
Year
DOI
Venue
2008
10.1109/TIT.2007.911251
IEEE Transactions on Information Theory
Keywords
DocType
Volume
Upper bound,Lattices,Mathematics,Linear code,Galois fields,Binary codes
Journal
54
Issue
ISSN
Citations 
1
0018-9448
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Sunghyu Han1356.52
Jon-Lark Kim231234.62