Asymptotically exact bounds on the size of high-order spectral-null codes
From MaRDI portal
Publication:4503370
DOI10.1109/18.782100zbMATH Open0958.94041OpenAlexW2166524251MaRDI QIDQ4503370FDOQ4503370
Authors: G. A. Freiman, Simon Litsyn 
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/10563e1d5d5d49a3d8798926e8385165bd80e521
Recommendations
- High-order spectral-null codes-constructions and bounds
- On efficient high-order spectral-null codes
- On efficient high-order spectral-null codes over them-ary alphabet
- Asymptotically exact uniform bounds for spectra of cosets of linear codes
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Geometric properties of high-order spectral-null codes
- On codes with spectral nulls at rational submultiples of the symbol frequency
- scientific article; zbMATH DE number 1456820
- Spectral-null codes and null spaces of Hadamard submatrices
- New upper bounds on the size of codes correcting asymmetric errors (Corresp.)
Cited In (9)
- Geometric properties of high-order spectral-null codes
- Title not available (Why is that?)
- Equal moments division of a set
- On a problem of Byrnes concerning polynomials with restricted coefficients, II
- Littlewood polynomials, spectral-null codes, and equipowerful partitions
- Double roots of random Littlewood polynomials
- Efficient Non-Recursive Design of Second-Order Spectral-Null Codes
- Asymptotically exact uniform bounds for spectra of cosets of linear codes
- Spectral-null codes and null spaces of Hadamard submatrices
This page was built for publication: Asymptotically exact bounds on the size of high-order spectral-null codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503370)
