On the size of maximal binary codes with 2, 3, and 4 distances
From MaRDI portal
Publication:6615496
DOI10.5070/C64163844MaRDI QIDQ6615496
Alexey Glazyrin, Wei-Hsuan Yu, Wei-Jiun Kao, Alexander Barg, Ching-Yi Lai, Pin-Chieh Tseng
Publication date: 8 October 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A construction of binary linear codes from Boolean functions
- A generalization of Larman-Rogers-Seidel's theorem
- Bounds on three- and higher-distance sets
- The exact bound in the Erdős-Ko-Rado theorem
- On a generalization of distance sets
- Spherical two-distance sets
- Forbidding just one intersection
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Spherical codes and designs
- Upper bounds for \(s\)-distance sets and equiangular lines
- Equiangular lines and spherical codes in Euclidean space
- A proof of a dodecahedron conjecture for distance sets
- Equiangular lines with a fixed angle
- Finite two-distance tight frames
- The weight distributions of two classes of binary cyclic codes
- Bounds on sets with few distances
- Equiangular lines
- A note on the spherical embeddings of strongly regular graphs
- On two-weight codes
- Graph Implementations for Nonsmooth Convex Programs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- New bounds for equiangular lines
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- The Geometry of Two-Weight Codes
- On Two-Distance Sets in Euclidean Space
- Semidefinite Programming Bounds for Constant-Weight Codes
- Extremal Problems for Finite Sets
- GLOBAL ASYMPTOTICS OF THE HAHN POLYNOMIALS
- Binary Linear Codes With Few Weights From Two-to-One Functions
- Strongly Regular Graphs
- The Geometry of Two-Weight Codes Over ℤpm
- On the Maximal Cardinality of Binary Two-weight Codes
- Four fundamental parameters of a code and their combinatorial significance
- Semidefinite Code Bounds Based on Quadruple Distances
- Bent Functions
- New Bounds for Spherical Two-Distance Sets
- Improved Semidefinite Programming Bound on Sizes of Codes
- New Bounds for Equiangular Lines and Spherical Two-Distance Sets
- The Closest Packing of Spherical Caps in n Dimensions
- Spherical two-distance sets and eigenvalues of signed graphs
- Forbidden intersections for codes
- Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New
- Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os
This page was built for publication: On the size of maximal binary codes with 2, 3, and 4 distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615496)
