Double circulant self-dual codes using finite-field wavelet transforms

20Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an example of integrating recently developed finite-field wavelet transforms into the study of error correcting codes. The primary goal of the paper is to demonstrate a straightforward approach to analyzing double circulant self-dual codes over any arbitrary finite-field using orthogonal filter bank structures. First, we discuss the proper combining of the cyclic mother wavelet and scaling sequence to satisfy the requirement of self-dual codes. Then as an example, we describe the encoder and decoder of a (12,6,4) self-dual code, and we demonstrate the simplicity and the computation reduction that the wavelet method offers for the encoding and decoding of this code. Finally, we give the mother wavelet and scaling sequence that generate the (24,12,8) Golay code.

Cite

CITATION STYLE

APA

Fekri, F., McLaughlin, S. W., Mersereau, R. M., & Schafer, R. W. (1999). Double circulant self-dual codes using finite-field wavelet transforms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1719, pp. 355–363). Springer Verlag. https://doi.org/10.1007/3-540-46796-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free