Trellis codes with a good distance profile constructed from expander graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhu, Yubin, Chen, Zitan
Format:	Preprint
Publié:	2026
Sujets:	Information Theory Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deletion-correcting codes for an adversarial nanopore channel
par: Xie, Huiling, et autres
Publié: (2026)

On constrained intersection representations of graphs and digraphs
par: Cicalese, Ferdinando, et autres
Publié: (2025)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
par: Ahmadypour, Niloufar, et autres
Publié: (2020)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
par: Li, Xin, et autres
Publié: (2024)

Perturbation-Resilient Trades for Dynamic Service Balancing
par: Sima, Jin, et autres
Publié: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Unbounded Error Correcting Codes
par: Efremenko, Klim, et autres
Publié: (2024)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
par: Con, Roni, et autres
Publié: (2024)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
par: Jenssen, Matthew, et autres
Publié: (2024)

Modularity and partially observed graphs
par: McDiarmid, Colin, et autres
Publié: (2021)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
par: Hou, Jiaxin, et autres
Publié: (2023)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
par: Goldenberg, Elazar, et autres
Publié: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
par: Gabric, Daniel, et autres
Publié: (2024)

Finding the diameter of a tree with distance queries
par: Gerbner, Dániel, et autres
Publié: (2025)

Random Schreier graphs as expanders
par: Caillat-Grenier, Geoffroy
Publié: (2023)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

Tight bounds for stream decodable error-correcting codes
par: Gupta, Meghal, et autres
Publié: (2024)

Worst-case optimal adaptive alphabetic prefix-free coding
par: Gagie, Travis
Publié: (2021)

Improved exploration of temporal graphs
par: Bastide, Paul, et autres
Publié: (2025)

Reconstructing edge-deleted unicyclic graphs
par: Pizzimenti, Anthony E., et autres
Publié: (2024)

Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing
par: Maier, Jakob, et autres
Publié: (2025)

More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
par: Ghentiyala, Surendra, et autres
Publié: (2024)

The connectivity carcass of a vertex subset in a graph: both odd and even case
par: Baswana, Surender, et autres
Publié: (2025)

On the complexity of edge subdivision to $H$-free graphs
par: Piecyk, Marta, et autres
Publié: (2026)

A note on Ordered Ruzsa-Szemerédi graphs
par: Pratt, Kevin
Publié: (2025)

Faithful universal graphs for minor-closed classes
par: Bastide, Paul, et autres
Publié: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
par: Yang, Chenxu, et autres
Publié: (2023)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
par: Michel, Lukas, et autres
Publié: (2024)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

Sampling and counting triangle-free graphs near the critical density
par: Jenssen, Matthew, et autres
Publié: (2024)

Kernelization for list $H$-coloring for graphs with small vertex cover
par: Piecyk, Marta, et autres
Publié: (2025)

Erdős-Gyárfás conjecture on graphs without long induced paths
par: Hegde, Anand Shripad, et autres
Publié: (2024)

On 2-strong connectivity orientations of mixed graphs and related problems
par: Georgiadis, Loukas, et autres
Publié: (2023)

Making an oriented graph acyclic using inversions of bounded or prescribed size
par: Bang-Jensen, Jørgen, et autres
Publié: (2025)