A new table of constant weight codes
From MaRDI portal
Publication:3199330
DOI10.1109/18.59932zbMath0713.94017OpenAlexW2041588219MaRDI QIDQ3199330
James B. Shearer, Warren D. Smith, N. J. A. Sloane, Andries E. Brouwer
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.59932
Related Items (71)
The completion of optimal cyclic quaternary codes of weight 3 and distance 3 ⋮ Upper bounds on the general covering numberCλ(v,k,t,m) ⋮ Matroids from hypersimplex splits ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ A geometric approach to finding new lower bounds of \(A(n,d,w)\) ⋮ Optimal constant weight codes over \(Z_k\) and generalized designs ⋮ Nonabelian sets with distinct \(k\)-sums ⋮ On the equivalence of certain constant weight codes and combinatorial designs ⋮ Error-detecting abilities of binary nonlinear constant weight codes ⋮ Unnamed Item ⋮ Sets in Abelian groups with distinct sums of pairs. ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ The nonexistence of \([71,5,46;3\)-codes] ⋮ The Maximum k-Colorable Subgraph Problem and Related Problems ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices ⋮ On the chromatic number, colorings, and codes of the Johnson graph ⋮ A note on the size of \(\mathscr{N}\)-free families ⋮ Modelling constant weight codes using tabu search ⋮ A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u/\langle u^m\rangle\)] ⋮ A new construction for \(q\)-ary constant weight codes ⋮ Some sequences of optimal constant weight codes ⋮ Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six ⋮ Finite field constructions of combinatorial arrays ⋮ Feeding Two Cats with One Bowl: On Designing a Fault and Side-Channel Resistant Software Encoding Scheme ⋮ Improvements to MCS algorithm for the maximum clique problem ⋮ Construction of optimal ternary constant weight codes via Bhaskar Rao designs ⋮ Sets in \(\mathbb{Z}_n\) with distinct sums of pairs. ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Biangular lines revisited ⋮ Optimal partitions for triples ⋮ Partitions of triples into optimal packings ⋮ Asymptotic bounds on the equilateral dimension of hypercubes ⋮ The completion determination of optimal \((3,4)\)-packings ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ A new approach for examining \(q\)-Steiner systems ⋮ Speeding up branch and bound algorithms for solving the maximum clique problem ⋮ Optimal binary constant weight codes and affine linear groups over finite fields ⋮ Bounds and constructions of asymmetric or unidirectional error-correcting codes ⋮ An upper bound for binary constant weight codes ⋮ Asymptotic Bounds for General Covering Designs ⋮ Asymptotic determination of the last packing number of quadruples ⋮ On constant composition codes ⋮ On the constructions of constant-composition codes from perfect nonlinear functions ⋮ Bounds on permutation codes of distance four ⋮ List decodability at small radii ⋮ Partition of triples of order \(6 k +5\) into \(6 k +3\) optimal packings and one packing of size \(8 k +4\) ⋮ New results on GDDs, covering, packing and directable designs with block size 5 ⋮ On the Security of RSM - Presenting 5 First- and Second-Order Attacks ⋮ Least adaptive optimal search with unreliable tests ⋮ Multiset combinatorial batch codes ⋮ Packing pairs by quintuples: The case of zero congruence mod 4 ⋮ Bounds on the sizes of constant weight covering codes ⋮ An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes ⋮ On equidistant constant weight codes ⋮ Tensors, matchings and codes ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm ⋮ Some binary maximin distance designs ⋮ Perfect two-fault tolerant search with minimum adaptiveness ⋮ Strand design for biomolecular computation. ⋮ On trace zero matrices and commutators ⋮ The last packing number of quadruples, and cyclic SQS ⋮ Test case generators and computational results for the maximum clique problem ⋮ Hanani triple packings and optimal \(q\)-ary codes of constant weight three ⋮ The maximum clique problem ⋮ New techniques for constructing \(t\)-EC/\(d\)-ED/AUED and \(t\)-EC/\(d\)-ED/\(s\)-UED codes ⋮ Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
This page was built for publication: A new table of constant weight codes
