ArXivCSExplorer
β˜†β˜†BookmarksπŸ†RSSHow to UseFAQ
Built with and by Teycir Ben Soltaneβ€’
How to Useβ€’FAQβ€’GitHubβ€’arXiv.orgβ€’
Share:

20 results for β€œbinary linear codes”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.β“˜

Want pure semantic search? Try claim verification β†’

cs.ITmath.COTheoreticalRecentAug 6, 2026

Moment-based linear programming bounds for locally recoverable codes

Shujian Li, Hengjia Wei, Maosheng Xiong

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.

View β†’
cs.ITTheoreticalRecentOct 26, 2026

The rank of $\mathbb{Z}_{2^s}$-linear Hadamard codes

Xuan Wang, Minjia Shi

The authors provide a method to compute the rank of canonical Z2s-linear Hadamard codes for any s.

View β†’
cs.ITcs.AIcs.NEEmpiricalRecentSep 29, 2026

Evolving Towards Better Codes: LLM-Guided Search for High-Distance Binary Linear Codes

Amal Seddas, Vladyslav Shashkov, Maryna Viazovska, Emmanuel Abbe

This paper uses large language models to improve the best-known bounds for binary linear codes.

View β†’
math.COcs.ITTheoreticalRecentAug 5, 2026

The generalized Griesmer and antiGriesmer bounds

Haihua Deng

The paper presents three proofs for the generalized Griesmer and antiGriesmer bounds, using different methods and demonstrating their equivalence.

View β†’
cs.ITmath.COEmpiricalRecentAug 14, 2026

New lower bounds for constant-weight codes via seeded bit-swap tabu search

William Echols

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.

View β†’
cs.ITcs.DMTheoreticalRecentOct 19, 2026

Block basis reduction for linear codes in non-Hamming metrics

N. S. Kolesnikov, S. A. Novoselov

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.

View β†’
cs.ITTheoreticalRecentOct 26, 2026

Subcodes with Prescribed Hull Dimensions in Linear Codes:Enumeration, Containment, and Asymptotic Distributions

Linhan Xiong, Hongwei Liu, Liren Lin

The paper determines the number of subcodes with prescribed dimension, hull dimension, and type over finite fields of both even and odd characteristic.

View β†’
cs.ITcs.CCcs.CRTheoreticalRecentJun 23, 2026

Discrepancy for Random Linear Codes

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.

View β†’
math.COcs.ITTheoreticalRecentOct 20, 2026

On the MDS conjecture in even characteristic

Bocong Chen, Jing Huang

Proves linear MDS conjecture in even characteristic

View β†’
cs.ITTheoreticalRecentJul 29, 2026

Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse $3$-Uniform Hypergraphs

Xuejiao Han, Yubo Sun, Gennian Ge

This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.

View β†’
cs.ITcs.CCcs.DSTheoreticalRecentJul 28, 2026

The Code Distortion Problem

Huck Bennett, Matthew Fox, Bryant Morrell

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.

View β†’
math.COcs.ITTheoreticalRecentJun 15, 2026

A geometric approach to generalized covering radii of linear codes

Gianira N. Alfarano, Giuseppe Marino, Alessandro Neri, Rocco Trombetti

This paper develops a geometric framework for generalized covering radii of linear codes.

View β†’
cs.ITTheoreticalRecentJul 7, 2026

From Bit to Block: Capacity Achievement via Product Coding

Bin Zhang

This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.

View β†’
cs.CCTheoreticalRecentJul 26, 2026

Trellis State Complexity as an Exact Tropical Factorization Rank

Karthik Sheshadri

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…

View β†’
cs.ITTheoreticalRecentJun 24, 2026

The MDS or NMDS for Modified GRS codes with flexible hull dimensions and lengths

Zhonghao Liang, Qunying Liao, Jun Zhang, Xiaoping Li

This paper studies the properties and constructions of non-generalized Reed-Solomon codes and their extended codes.

View β†’
cs.ITcs.CCcs.DMTheoreticalRecentOct 1, 2026

Two-Sided Product Expanding Codes via Rademacher Matrices

Eshan Chattopadhyay, Noam Ringach, Nicholas Spooner

The paper proves the existence of two-sided product expanding codes without relying on explicit constructions of asymptotically optimal locally testable codes.

View β†’
cs.ITmath.RATheoreticalRecentJun 9, 2026

On concatenation of matrices for reversible linear codes over a finite commutative ring and applications to DNA codes

Avanish Kumar Chaturvedi, Satyadeep Pandey

Develops a framework for constructing reversible linear, reversible self-dual, and reversible DNA codes using involutory matrices.

View β†’