20 results for “Coding theory”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
A Set Shaping Theory transformation reduces the average universal coding length of uniformly generated sequences.
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.
This paper uses large language models to improve the best-known bounds for binary linear codes.
This paper develops a geometric framework for generalized covering radii of linear codes.
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.
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
The paper presents three proofs for the generalized Griesmer and antiGriesmer bounds, using different methods and demonstrating their equivalence.
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.
This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.
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…
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 derives new linear programming bounds for q-ary (r,δ)-locally recoverable codes, improving upon previous bounds and applying to both linear and nonlinear codes.
This paper analytically characterizes the conditions under which multi-letter extended AH coding improves upon SW coding in the modulo-sum problem.
This paper studies extremal intersections of deletion balls over a fixed q-ary alphabet and derives upper bounds for their sizes.
This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.
The paper constructs Schubert subspace codes with maximum possible size in certain extremal distance cases using two methods: direct-sum decomposition and field reduction.