Please use this identifier to cite or link to this item:
Title: Decomposing quasi-cyclic codes
Authors: Ling, S. 
Solé, P.
Issue Date: 2000
Citation: Ling, S.,Solé, P. (2000). Decomposing quasi-cyclic codes. Electronic Notes in Discrete Mathematics 6 : 1-11. ScholarBank@NUS Repository.
Abstract: A new algebraic approach to quasi-cyclic codes is introduced. Technical tools include the Chinese Remainder Theorem, the Discrete Fourier Transform, Chain rings. The main results are a characterization of self-dual quasi-cyclic codes, a trace representation that generalizes that of cyclic codes, and an interpretation of the squaring and cubing construction (and of several similar combinatorial constructions). All extended quadratic residue codes of length a multiple of three are shown to be attainable by the cubing construction. Quinting and septing constructions are introduced.
Source Title: Electronic Notes in Discrete Mathematics
ISSN: 15710653
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.