Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
From MaRDI portal
Recommendations
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- On the constructions of constant-weight codes
- New explicit binary constant weight codes from Reed-Solomon codes
- A new table of constant weight codes
- Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths
Cites work
- A new table of constant weight codes
- An algorithm for source coding
- Codes on Euclidean spheres
- Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Enumerative source encoding
- scientific article; zbMATH DE number 3156373 (Why is no real title available?)
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 6541785 (Why is no real title available?)
- Lexicographic ordering, ranking and unranking of combinations
- Lower bounds for constant weight codes
- New constructions of optimal cyclically permutable constant weight codes
- On a formula for numbers.
- Optical orthogonal codes-new bounds and an optimal construction
- Principles of Digital Communication
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- The coolest way to generate combinations
- Upper bounds for constant-weight codes
This page was built for publication: Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651916)
