On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes

Takayasu KAIDA

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E98-A    No.12    pp.2476-2479
Publication Date: 2015/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E98.A.2476
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
defining set,  discrete Fourier transform,  rank bounded distance,  minimum distance,  cyclic code,  

Full Text: PDF(99.8KB)>>
Buy this Article

The authors proposed an algorithm for calculation of new lower bound (rank bounded distance) using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm with moving the row or column. In this paper, we discuss the calculation method of the rank bounded distance by conjugate elements for cyclic codes.