Upper bounds for constant-weight codes
From MaRDI portal
Publication:2705972
DOI10.1109/18.887851zbMath0997.94036OpenAlexW2137806147MaRDI QIDQ2705972
Alexander Vardy, Kenneth Zeger, Erik Agrell
Publication date: 19 March 2001
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://research.chalmers.se/en/publication/14986
linear programmingupper boundsJohnson boundDelsarte inequalitiesconstant-weight codesdoubly-bounded-weight codesdoubly-constant-weight codeszonal codes
Related Items (25)
A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids ⋮ New explicit binary constant weight codes from Reed-Solomon codes ⋮ Matroids are not Ehrhart positive ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ A new construction for \(q\)-ary constant weight codes ⋮ Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six ⋮ Exact and Parameterized Algorithms for (k, i)-Coloring ⋮ Construction of optimal ternary constant weight codes via Bhaskar Rao designs ⋮ Optimal binary constant weight codes and affine linear groups over finite fields ⋮ Optimal multiply constant-weight codes from generalized Howell designs ⋮ On the constructions of constant-composition codes from perfect nonlinear functions ⋮ Generalized vector space partitions ⋮ Optimal combinatorial batch codes based on block designs ⋮ Bounds for codes by semidefinite programming ⋮ Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров ⋮ Improved linear programming bound on sizes of doubly constant-weight codes ⋮ Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes ⋮ Application of cover-free codes and combinatorial designs to two-stage testing. ⋮ Fundamentals of coding type problems ⋮ Coding Theory Motivated by Relational Databases ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ Rank-Metric Codes and Their Applications ⋮ Hanani triple packings and optimal \(q\)-ary codes of constant weight three ⋮ Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\)
Uses Software
This page was built for publication: Upper bounds for constant-weight codes
