Back to Search
Start Over
BCH Codes for the Rosenbloom–Tsfasman Metric.
- Source :
-
IEEE Transactions on Information Theory . Dec2016, Vol. 62 Issue 12, p6757-6767. 11p. - Publication Year :
- 2016
-
Abstract
- The Rosenbloom–Tsfasman metric has attracted the attention of many researchers as a generalization of the Hamming metric that is relevant to practical problems. Codes for this metric were considered. In particular, Reed–Solomon codes were generalized to be compatible with this metric. In this paper, a generalization of BCH codes for the Rosenbloom–Tsfasman metric is proposed. This generalization is based on considering BCH codes as subfield subcodes of Reed–Solomon codes. By characterizing these subfield subcodes, an explicit construction of BCH codes for the Rosenbloom–Tsfasman metric is provided. Two important properties of Reed–Solomon codes and BCH codes for the Rosenbloom–Tsfasman metric are studied and compared with those for the Hamming metric. These properties are cyclic structure and duality. The approach is based on Galois-Fourier transforms associated with Hasse derivatives. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 62
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 119616380
- Full Text :
- https://doi.org/10.1109/TIT.2016.2617312