Live briefing
Everything about Cyclic code
Type of block code
In coding theory, a cyclic code is a block code, where the circular shifts of each codeword gives another word that belongs to the code. They are error-correcting codes that have algebraic properties that are convenient for efficient error detection and correction. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Cyclic codeA 5-minute orientation
- Skim a recent paper: A Hybrid DCSK Scheme Combining Cyclic Shift Keying and Code Index ModulationInfluential work since 2022
- Pick up a classic book: Noncommutative rings and their applicationsThe most-reprinted book on the subject
- Read the landmark paper: The condition for a cyclic code to have a complementary dualCited 184 times
- Go sideways: BCH codeA closely related topic
- Go sideways: Reed–Solomon error correctionA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
The condition for a cyclic code to have a complementary dual
Kerdock code in a cyclic form
Generalized quasi-cyclic codes: structural properties and code construction
Development of new two-dimensional spectral/spatial code based on dynamic cyclic shift code for OCDMA system
How Many Weights Can a Cyclic Code Have?
Efficient Network Code Design for Cyclic Networks
A Cyclic Code for Double Error Correction [Letter to the Editor]
Spectral Method for Quasi-Cyclic Code Analysis
🆕 Influential since 2022
A Hybrid DCSK Scheme Combining Cyclic Shift Keying and Code Index Modulation
DNA Code from Cyclic and Skew Cyclic Codes over F4[v]/⟨v3⟩
Cyclic Transfer Learning for Mandarin-English Code-Switching Speech Recognition
A Tight Upper Bound on the Number of Non-Zero Weights of a Cyclic Code
Area-Efficient QC-LDPC Decoding Architecture With Thermometer Code-Based Sorting and Relative Quasi-Cyclic Shifting
đź“š Books worth reading
- 📕Noncommutative rings and their applicationsFrance) International Conference on Noncommutative Rings and Their Applications (2013 Artois · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- BCH code In coding theory, the Bose–Chaudhuri–Hocquenghem codes (BCH codes) form a class of cyclic error-correcting codes that are constructed using polynomials…
- Reed–Solomon error correction In information theory and coding theory, Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon…
- Burst error-correcting code In coding theory, burst error-correcting codes employ methods of correcting burst errors, which are errors that occur in many consecutive bits rather than…
- Polynomial code In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length)…
- Coding theory approaches to nucleic acid design DNA code construction refers to the application of coding theory to the design of nucleic acid systems for the field of DNA–based computation. DNA sequences…
- Finite field In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that has a finite number of elements. As with any field…
- Linear code In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword. Linear codes are traditionally…
- Mathematics of cyclic redundancy checks The cyclic redundancy check (CRC) is a check of the remainder after division in the ring of polynomials over GF(2) (the finite field of integers modulo…