High-order spectral-null codes-constructions and bounds
From MaRDI portal
Publication:4850283
DOI10.1109/18.340458zbMATH Open0826.94030OpenAlexW2171784911MaRDI QIDQ4850283FDOQ4850283
Authors: Ron M. Roth, Alexander Vardy, Paul Siegel 
Publication date: 9 November 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/00f73cb3e37553080098a0b4fbc61a33f134c583
Recommendations
Cited In (14)
- Geometric properties of high-order spectral-null codes
- Title not available (Why is that?)
- Littlewood polynomials, spectral-null codes, and equipowerful partitions
- Asymptotically exact bounds on the size of high-order spectral-null codes
- On efficient high-order spectral-null codes over them-ary alphabet
- On codes satisfying Mth-order running digital sum constraints
- Efficient Non-Recursive Design of Second-Order Spectral-Null Codes
- On codes with spectral nulls at rational submultiples of the symbol frequency
- Combinatorial properties of balanced codes over the complexm-th roots of unity and efficient coding algorithms
- Design of Efficient Second-Order Spectral-Null Codes
- On efficient high-order spectral-null codes
- Irreducible components of canonical diagrams for spectral nulls
- Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency
- Spectral-null codes and null spaces of Hadamard submatrices
This page was built for publication: High-order spectral-null codes-constructions and bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850283)
