Incomplete sums, DC-constrained codes, and codes that maintain synchronization
From MaRDI portal
Recommendations
Cites work
- Algebraic coding theory
- An Asymptotic Lower Bound for the Character Sums induced by the Legendre Symbol
- Balanced nonbinary sequences with good periodic correlation properties obtained from modified Kumar-Moreno sequences
- Character sums and primitive roots in finite fields
- Comma-Free Codes
- DC-constrained codes from Hadamard matrices
- Efficient balanced codes
- Equations over finite fields. An elementary approach
- scientific article; zbMATH DE number 3871445 (Why is no real title available?)
- scientific article; zbMATH DE number 3520487 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3414188 (Why is no real title available?)
- scientific article; zbMATH DE number 3055543 (Why is no real title available?)
- Information rates and power spectra of digital codes
- On error-correcting balanced codes
- Some lower bounds on the number of code points in a minimum distance binary code. I
Cited in
(4)
This page was built for publication: Incomplete sums, DC-constrained codes, and codes that maintain synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802188)