22 problems
- 0 votes0 replies0 views
Doubly even code order conjecture
Let be a doubly even binary code of length , and let be the inverse image of under the natural map … Let denote the ring g…
- 0 votes0 replies0 views
Maximal-order uniqueness conjecture for maximal doubly even codes
Let be a maximal doubly even binary code, and let . Consider the Clifford algebra and the rational Clifford alg…
- 0 votes0 replies0 views
Choi et al.'s optimal-code characterization of the LCP lower bound
Choi et al.'s conjecture. There exists a unique binary optimal code which is even-like and contains if and only if
- 0 votes0 replies0 views
Tietäväinen's conjecture on binary codes near the Plotkin bound
Let denote the maximum size of a binary code of block length and minimum Hamming distance . For , consider binary codes with distance…
- 0 votes0 replies0 views
Conjecture on largest minimum distances of binary self-orthogonal codes of dimension 5
Let denote the largest minimum distance of a binary linear code, and let denote the largest minimum distance of a binary self-orthogonal code…
- 0 votes0 replies1 view
Nonexistence of binary quasi group codes with involutory permutation automorphism group
Let be a binary quasi group code of length , and let denote its permutation automorphism group. Nonexistence conjecture. There is no binary qua…
- 0 votes0 replies1 view
Optimal binary linear insertion-deletion code parameter conjecture
Optimal binary linear insertion-deletion code conjecture. If , , and is optimal with respect to the strict half-Singleton bound, then…
- 0 votes0 replies0 views
The conjecture that the Gilbert–Varshamov bound is asymptotically optimal in the ultra-low-rate regime
Gilbert–Varshamov optimality conjecture. There does not exist any binary code exceeding the Gilbert–Varshamov lower bound.
- 0 votes0 replies0 views
The binary nonexistence conjecture for self-dual polycyclic codes
A polycyclic code over the binary field may be self-dual, self-orthogonal, or dual-containing. Binary nonexistence conjecture. There is no self-dual, self-orthogonal…
- 0 votes0 replies0 views
The nonexistence conjecture for binary self-dual, self-orthogonal and dual-containing polycyclic codes
Let be a polycyclic code over the binary field . Binary nonexistence conjecture. There are no polycyclic codes over that are self-dual, self-orthogonal, or dua…
- 0 votes0 replies0 views
Conjecture on the parameters and weight distribution of codes from almost bent exponents
Parameter and weight-distribution conjecture. The parameters of should be the same as those of the code in the cited theorem, namely the theorem's parameters for th…
- 0 votes0 replies0 views
Conjecture on the weight distribution of a binary linear code from a two-to-one polynomial
The weight-distribution conjecture. The polynomial is two-to-one over , the code has parameters
- 0 votes0 replies0 views
Minimum-weight MIPPR word conjecture for minimal PPRIC codes
Let , , and be nonnegative integers with , and let be a minimal PPRIC code. An MIPPR word is a word associated with…
- 0 votes0 replies0 views
Completeness conjecture for doubly even binary [45,8,20] codes
Completeness conjecture. There are no doubly even binary codes beyond those obtained in the cited classification.
- 0 votes0 replies0 views
The optimal-scaling conjecture for binary codes in coded distributed computing
A binary code is asymptotically optimal in the sense defined in Theorem 7 if its performance achieves the capacity of binary erasure channels (BECs) with the optimal scaling expone…
- 0 votes0 replies1 view
Conjectured local maxima for the number of weights of binary cyclic codes
Let denote the largest number of nonzero weights in a binary cyclic code of length and dimension . Fix of the form … For each , let be an irr…
- 0 votes0 replies0 views
The 2-elementary quotient conjecture in dimensions 10–12
Let be a lattice in dimension , and let denote the sublattice generated by the minimal vectors. The quotient is 2-elementa…
- 0 votes0 replies0 views
Exactness and indecomposability conjecture for the lower bounds of
Let denote the maximum number of minimal codewords among binary linear codes of parameters . Let the lower bounds listed in Table 2 of the paper be the bounds obtai…
- 0 votes0 replies0 views
Upper-bound conjecture for binary self-dual codes of length 40
Let denote the number of inequivalent binary self-dual codes of length . Upper-bound conjecture. The number of the inequivalent binary self-dual codes of length …
- 0 votes0 replies0 views
Keith's dimension conjecture for the passant–internal incidence null space
Keith's conjecture.
- 0 votes0 replies0 views
Droms–Mellinger–Meyer dimension conjecture for projective-plane LDPC codes
Let be an odd prime power, and let and be the incidence matrices of internal points versus secant lines and external points versus passant lines,…
- 0 votes0 replies0 views
Potapov's splittability conjecture for double-MDS-codes
Let be the -dimensional binary Hamming space, let be a double-MDS-code, and let denote its complement. Potapov's conjecture. The code…