Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/154517| Title: | Quasi-cyclic codes | Authors: | Güneri, Cem Ling, San Özkaya, Buket |
Keywords: | Engineering::Computer science and engineering::Information systems Engineering::Computer science and engineering::Theory of computation |
Issue Date: | 2021 | Publisher: | CRC Press, Taylor & Francis Group | Source: | Güneri, C., Ling, S. & Özkaya, B. (2021). Quasi-cyclic codes. W. C. Huffman, J.-L. Kim & P. Solé (Eds.), Concise Encyclopedia of Coding Theory (pp. 129-150). CRC Press, Taylor & Francis Group. | Abstract: | Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some asymptotic results, a few minimum distance bounds and further applications such as the trace representation and characterization of certain subfamilies of quasi-cyclic codes are elaborated. This survey will appear as a chapter in "A Concise Encyclopedia of Coding Theory" to be published by CRC Press. | URI: | https://hdl.handle.net/10356/154517 | ISBN: | 9781138551992 | Rights: | © 2021 Taylor & Francis Group, LLC. All rights reserved. | Fulltext Permission: | none | Fulltext Availability: | No Fulltext |
| Appears in Collections: | SPMS Books & Book Chapters |
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.