On optimal and proper binary codes from irreducible cyclic codes over GF(2(m))

Authors
Sakakibara, K Iwasa, R Yuba, Y
Citation
K. Sakakibara et al., On optimal and proper binary codes from irreducible cyclic codes over GF(2(m)), IEICE T FUN, E82A(10), 1999, pp. 2191-2193
Citations number
9
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
ISSN journal
09168508 → ACNP
Volume
E82A
Issue
10
Year of publication
1999
Pages
2191 - 2193
Database
ISI
SICI code
0916-8508(199910)E82A:10<2191:OOAPBC>2.0.ZU;2-T
Abstract
We prove that binary images of irreducible cyclic codes C over GF(2(m)) and binary concatenated codes of C and a binary [m + 1, m, 2] even-parity code are optimal (in the sense that they meet the Griesmer bound with equality) and proper, if a root of the check polynomial of C is primitive over GF(2( m)) or its extensions.