The following pages link to (Q4793326):
Displaying 34 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- On the Varshamov-Tenengolts construction on binary strings (Q393366) (← links)
- Combinatorics of Boolean automata circuits dynamics (Q412329) (← links)
- Rotation symmetric Boolean functions-count and cryptographic properties (Q944705) (← links)
- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes (Q1009036) (← links)
- A constructive count of rotation symmetric functions (Q1029033) (← links)
- A sublattice of the Leech lattice (Q1076062) (← links)
- Lattices with theta functions for G(\(\sqrt{2})\) and linear codes (Q1086608) (← links)
- Examples of even unimodular extremal lattices of rank 40 and their Siegel theta-series of degree 2 (Q1099209) (← links)
- On self-dual, doubly even codes of length 32 (Q1120541) (← links)
- Self-dual codes over GF(5) (Q1163524) (← links)
- On the enumeration of lattices of determinant one (Q1170281) (← links)
- The unimodular lattices of dimension up to 23 and the Minkowski-Siegel mass constants (Q1170282) (← links)
- An \(E_ 8-\)approach to the Leech lattice and the Conway group (Q1172146) (← links)
- Self-dual codes over the integers modulo 4 (Q1208037) (← links)
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions (Q1258520) (← links)
- On the nonexistence of extremal self-dual codes (Q1283805) (← links)
- A gluing technique for constructing relatively self-dual codes (Q1323836) (← links)
- Weight distributions of linear codes and the Gleason-Pierce theorem (Q1331144) (← links)
- Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes (Q1650802) (← links)
- The packing number of the double vertex graph of the path graph (Q1671357) (← links)
- Analogue of vertex operator triality for ternary codes (Q1892304) (← links)
- An efficiently generated family of binary de Bruijn sequences (Q2022156) (← links)
- A number theoretic view on binary shift registers (Q2088954) (← links)
- Dynamic node packing (Q2097666) (← links)
- The Modular Subset-Sum Problem and the size of deletion correcting codes (Q2161417) (← links)
- A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes (Q2174597) (← links)
- Deletion correcting codes meet the Littlewood-Offord problem (Q2205891) (← links)
- Construction of single-deletion-correcting DNA codes using CIS codes (Q2211338) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes (Q2383997) (← links)
- A class of group divisible 3-designs and their applications (Q3619606) (← links)
- Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs (Q5055970) (← links)
- BCH Codes with Minimum Distance Proportional to Code Length (Q5150816) (← links)
