20 results for βbinary linear codesβ
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.β
Want pure semantic search? Try claim verification β
This paper derives new linear programming bounds for q-ary (r,Ξ΄)-locally recoverable codes, improving upon previous bounds and applying to both linear and nonlinear codes.
The authors provide a method to compute the rank of canonical Z2s-linear Hadamard codes for any s.
This paper uses large language models to improve the best-known bounds for binary linear codes.
The paper presents three proofs for the generalized Griesmer and antiGriesmer bounds, using different methods and demonstrating their equivalence.
The paper uses seeded initialization with bit-swap tabu search to find new constructions for binary constant-weight codes, improving existing lower bounds and corollary kissing numbers.
The paper generalizes the code basis reduction to non-Hamming metrics and proposes a block basis reduction algorithm for codes that works for all coordinate-additive metrics.
The paper determines the number of subcodes with prescribed dimension, hull dimension, and type over finite fields of both even and odd characteristic.
Dean Doron, Tal Leonov, Jonathan Mosheiff, Henrique Navas +2 more
This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.
Proves linear MDS conjecture in even characteristic
This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.
This paper studies the minimum distortion of a linear mapping between two linear error-correcting codes and introduces the Code Distortion Problem, which asks to find a minimum distortion mapping.
This paper develops a geometric framework for generalized covering radii of linear codes.
This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.
This paper proves that the min-plus factorization rank and tropical rank of a binary linear code's conditional decoding matrix equal 2^s, where s is the classical state complexity of the minimal trellβ¦
This paper studies the properties and constructions of non-generalized Reed-Solomon codes and their extended codes.
The paper proves the existence of two-sided product expanding codes without relying on explicit constructions of asymptotically optimal locally testable codes.
Develops a framework for constructing reversible linear, reversible self-dual, and reversible DNA codes using involutory matrices.