Fundamentals of coding type problems
From MaRDI portal
Publication:3637813
DOI10.1080/09720529.2007.10698106zbMath1172.94644OpenAlexW2324446895MaRDI QIDQ3637813
Publication date: 14 July 2009
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2007.10698106
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The complete intersection theorem for systems of finite sets
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
- Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces
- Diametric theorems in sequence spaces
- On the maximum number of permutations with given maximal or minimal distance
- The diametric theorem in Hamming spaces---optimal anticodes
- Upper bounds on permutation codes via linear programming
- On a generalization of both affine planes and MDS-codes with applications to experiment planning
- Small additive quaternary codes.
- Perfect codes in the graphs \(O_k\)
- Slight improvements of the Singleton bound
- New upper bounds on Lee codes
- Factoring by subsets
- On covering sets and error-correcting codes
- Perfect codes in graphs
- A Lloyd theorem in weakly metric association schemes
- Upper bounds for constant-weight codes
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
- Upper bounds on codes correcting asymmetric errors (Corresp.)
- Perfect (d,k)-codes capable of correcting single peak-shifts
- The linear programming bound for binary linear codes
- Bounds on mixed binary/ternary codes
- Fundamentals of Error-Correcting Codes
- Improved upper bounds on sizes of codes
- Bounds and constructions for codes correcting unidirectional errors
- The Erdös-Ko-Rado Theorem for Integer Sequences
- A general formulation of error matrices (Corresp.)
- Rook domains, Latin squares, affine planes, and error-distributing codes
- T-shift synchronization codes
- On perfect codes and related concepts
- Error-correcting codes over an alphabet of four elements
This page was built for publication: Fundamentals of coding type problems
