ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “coding theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.ITEmpiricalRecentJun 15, 2026

Set Shaping Theory Applied to Universal Coding

Alix Petit, Aida Koch, Logan Lewis, Lily Scott

A Set Shaping Theory transformation reduces the average universal coding length of uniformly generated sequences.

View →
cs.ITcs.AImath.CTTheoreticalRecentJul 15, 2026

CAS I: A Geometric Coding Theorem

Romie Banerjee

This paper establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.

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.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 →
math.COcs.ITTheoreticalRecentJul 3, 2026

The multilinear forms Cayley graph and the eigenvalue method for tensor codes

Eimear Byrne, Lucien François

This paper generalizes the connection between graph theory, association schemes, and coding theory to the space of tensors over a finite field, and derives the spectrum of the corresponding graph.

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

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.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.DSTheoreticalRecentJul 17, 2026

A Unified Theory of Sparsification

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

View →
stat.MLcs.CCcs.DSTheoreticalRecentJul 7, 2026

Boosting with List-Decodable Codes

Addison Prairie, Li-Yang Tan

A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…

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 →
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.ITTheoreticalRecentJun 24, 2026

The Condition for Structured Coding to Improve Random Coding in the Binary Modulo-sum Problem

Yohsuke Tsujino, Shun Watanabe

This paper analytically characterizes the conditions under which multi-letter extended AH coding improves upon SW coding in the modulo-sum problem.

View →
math.COcs.ITTheoreticalRecentJun 24, 2026

Extremal Deletion-Ball Intersections under Run-Count and Lower-Order Deletion-Ball Intersection Constraints

Yubo Sun, Gennian Ge

This paper studies extremal intersections of deletion balls over a fixed q-ary alphabet and derives upper bounds for their sizes.

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 →
math.COcs.ITTheoreticalRecentJul 8, 2026

Combinatorial constructions of Schubert subspace codes

Gianira N. Alfarano, Alessandro Neri, Beatrice Toesca

The paper constructs Schubert subspace codes with maximum possible size in certain extremal distance cases using two methods: direct-sum decomposition and field reduction.

View →