Selected unsolved problems in coding theory.
DOI10.1007/978-0-8176-8256-9zbMATH Open1239.94001OpenAlexW574013035WikidataQ60691720 ScholiaQ60691720MaRDI QIDQ636050FDOQ636050
Authors: Jon-Lark Kim, David Joyner
Publication date: 25 August 2011
Published in: Applied and Numerical Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-8176-8256-9
Recommendations
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cited In (11)
- On the Riemann hypothesis for a certain family of formal weight enumerators
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Riemann hypothesis analogue for near-MDS codes
- Quasi-quadratic residue codes and hyperelliptic curves
- The weight distribution of quasi-quadratic residue codes
- Title not available (Why is that?)
- Open problems in coding theory
- A projection decoding of a binary extremal self-dual code of length 40
- On the location of zeros of quasi-orthogonal polynomials with applications to some real self-reciprocal polynomials
- Self-inversive polynomials, curves, and codes
Uses Software
This page was built for publication: Selected unsolved problems in coding theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q636050)