Dey, Bikash Kumar ; Sundar Rajan, B. (2003) DFT domain characterization of quasi-cyclic codes Applicable Algebra in Engineering, Communication and Computing, 13 (6). pp. 453-474. ISSN 0938-1279
Full text not available from this repository.
Official URL: https://link.springer.com/article/10.1007/s00200-0...
Related URL: http://dx.doi.org/10.1007/s00200-003-0117-5
Abstract
The transform domain characterization of linear cyclic codes over finite fields using Discrete Fourier Transform (DFT) over an appropriate extension field is well known. In this paper, we extend this transform domain characterization for linear quasi-cyclic codes over finite fields. We show how one can derive a lower bound on the minimum Hamming distance of a quasi-cyclic code and decode the code upto that minimum Hamming distance using this characterization.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| Keywords: | Quasi-cyclic Codes; Discrete Fourier Transform; Cyclotomic Cosets |
| ID Code: | 108067 |
| Deposited On: | 08 Dec 2017 10:15 |
| Last Modified: | 08 Dec 2017 10:15 |
Repository Staff Only: item control page
