Cover Image

A general method for the development of constrained codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ryabko, Boris
Format:	Preprint
Published:	2024
Subjects:	Information Theory 94A29
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Error correction methods based on two-faced processes
by: Ryabko, Boris
Published: (2026)

Optimal redundancy of function-correcting codes
by: Ge, Gennian, et al.
Published: (2025)

Local Grammar-Based Coding Revisited
by: Dębowski, Łukasz
Published: (2022)

A Family of LZ78-based Universal Sequential Probability Assignments
by: Sagan, Naomi, et al.
Published: (2024)

Perfect message authentication codes are robust to small deviations from uniform key distributions
by: Ryabko, Boris
Published: (2025)

Model agnostic signal encoding by leaky integrate and fire, performance and uncertainty
by: Carbajal, Diana, et al.
Published: (2024)

On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
by: Galindo, Carlos, et al.
Published: (2020)

Two classes of NMDS codes from Roth-Lempel codes
by: Liang, Zhonghao, et al.
Published: (2025)

Nonexistence of generalized bent functions and the quadratic norm form equations
by: Lv, Chang, et al.
Published: (2018)

Secure Rate-Distortion-Perception: A Randomized Distributed Function Computation Approach for Realism
by: Åhlgren, Gustaf, et al.
Published: (2026)

Quantum codes from affine variety codes and their subfield-subcodes
by: Galindo, Carlos, et al.
Published: (2014)

The error-correcting pair for several classes of NMDS linear codes
by: He, Dong, et al.
Published: (2025)

The equivalent condition for GRL codes to be MDS, AMDS or self-dual
by: Liang, Zhonghao, et al.
Published: (2025)

The weight distributions of some linear codes derived from Kloosterman sums
by: Zhao, Mengzhen, et al.
Published: (2024)

On the burst-covering radius of binary cyclic codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2026)

On the Ding and Helleseth's 8th open problem about optimal ternary cyclic codes
by: He, Dong, et al.
Published: (2025)

On the maximum size of variable-length non-overlapping codes
by: Wang, Geyang, et al.
Published: (2024)

A characterization for an almost MDS code to be a near MDS code and a proof of the Geng-Yang-Zhang-Zhou conjecture
by: Qiang, Shiyuan, et al.
Published: (2024)

High-Dimensional Signal Compression: Lattice Point Bounds and Metric Entropy
by: Iosevich, A., et al.
Published: (2026)

Construction of 2-D Z-Complementary Array Code Sets with Flexible Lengths for Different System Requirements
by: Roy, Abhishek
Published: (2021)

Limitations of the decoding-to-LPN reduction via code smoothing
by: Pathegama, Madhura, et al.
Published: (2024)

Factoring Perfect Reconstruction Filter Banks into Causal Lifting Matrices: A Diophantine Approach
by: Brislawn, Christopher M.
Published: (2019)

The extended code for a class of generalized Roth-Lempel codes and their properties
by: Liang, Zhonghao, et al.
Published: (2025)

Entropic Conditional Central Limit Theorem and Hadamard Compression
by: Ma, Zhi-Ming, et al.
Published: (2024)

Revisiting the Unicity Distance through a Channel Transmission Perspective
by: Lin, Fangyuan
Published: (2024)

Phase Transitions of the Additive Uniform Noise Channel with Peak Amplitude and Cost Constraint
by: Stapmanns, Jonas, et al.
Published: (2025)

A systematic review of secure coded caching
by: Ng, S. -L., et al.
Published: (2026)

The Causal Complementation Algorithm for Lifting Factorization of Perfect Reconstruction Multirate Filter Banks
by: Brislawn, Christopher M.
Published: (2024)

Universal coding, intrinsic volumes, and metric complexity
by: Mourtada, Jaouad
Published: (2023)

Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet Sizes
by: Roy, Abhishek, et al.
Published: (2024)

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
by: Frydrych, Piotr
Published: (2026)

A recursive approach to the construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
by: Yadav, Monika, et al.
Published: (2025)

On nonlinear compression costs: when Shannon meets Rényi
by: Somazzi, Andrea, et al.
Published: (2023)

On functions of low differential uniformity in characteristic 2: A close look (I)
by: Anbar, Nurdagül, et al.
Published: (2024)

Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
by: Yadav, Monika, et al.
Published: (2025)

Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel
by: Chan, Chin Hei, et al.
Published: (2021)

An upper bound on the size of a code with $s$ distances
by: Landjev, Ivan, et al.
Published: (2025)

Optimal Inference for Distributed Detection
by: Akofor, Earnest
Published: (2016)

On Optimal MMSE Channel Estimation for One-Bit Quantized MIMO Systems
by: Ding, Minhua, et al.
Published: (2024)

Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field
by: Huang, Longxiu, et al.
Published: (2024)