English
Related papers

Related papers: Strongly Separable Codes

200 papers

This work focuses on sequential locally recoverable codes (SLRCs), a special family of locally repairable codes, capable of correcting multiple code symbol erasures, which are commonly used for distributed storage systems. First, we…

Information Theory · Computer Science 2025-07-14 Akram Baghban , Marc Newman , Anna-Lena Horlemann , Mehdi Ghiyasvand

We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most…

Information Theory · Computer Science 2015-12-04 Lei M. Zhang , Dmitri Truhachev , Frank Kschischang

Variable-length splittable codes are derived from encoding sequences of ordered integer pairs, where one of the pair's components is upper bounded by some constant, and the other one is any positive integer. Each pair is encoded by the…

Information Theory · Computer Science 2015-08-07 Anatoly V. Anisimov , Igor O. Zavadskyi

Frameproof codes are used to preserve the security in the context of coalition when fingerprinting digital data. Let $M_{c,l}(q)$ be the largest cardinality of a $q$-ary $c$-frameproof code of length $l$ and $R_{c,l}=\lim_{q\rightarrow…

Combinatorics · Mathematics 2012-06-27 Yeow Meng Chee , Xiande Zhang

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…

Information Theory · Computer Science 2019-06-17 Homa Esfahanizadeh , Ruiyi Wu , Lara Dolecek

This paper develops a new family of locally recoverable codes for distributed storage systems, Sequential Locally Recoverable Codes (SLRCs) constructed to handle multiple erasures in a sequential recovery approach. We propose a new…

Information Theory · Computer Science 2025-03-05 Akram Baghban , Mehdi Ghiyasvand

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…

Information Theory · Computer Science 2016-11-18 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length $tk$ and dimension $k$ is called a complementary information set code of order $t$ ($t$-CIS code for short) if it has $t$ pairwise…

Information Theory · Computer Science 2014-06-19 Claude Carlet , Finley Freibert , Sylvain Guilley , Michael Kiermaier , Jon-Lark Kim , Patrick Solé

In this paper, we study the signature codes for weighted binary adder channel (WbAC) and collusion-resistant multimedia fingerprinting. Let $A(n,t)$ denote the maximum cardinality of a $t$-signature code of length $n$, and $A(n,w,t)$ denote…

Information Theory · Computer Science 2020-10-27 Jinping Fan , Yujie Gu , Masahiro Hachimori , Ying Miao

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes…

Information Theory · Computer Science 2022-02-25 Min Qiu , Xiaowei Wu , Jinhong Yuan , Alexandre Graell i Amat

Spatially coupled codes have been of interest recently owing to their superior performance over memoryless binary-input channels. The performance is good both asymptotically, since the belief propagation thresholds approach capacity, as…

Information Theory · Computer Science 2012-12-03 Aravind R. Iyengar , Paul H. Siegel , Rudiger L. Urbanke , Jack K. Wolf

The peeling decoding for spatially coupled low-density parity-check (SC-LDPC) codes is analyzed for a binary erasure channel. An analytical calculation of the mean evolution of degree-one check nodes of protograph-based SC-LDPC codes is…

Information Theory · Computer Science 2014-02-03 Markus Stinner Pablo M. Olmos

This paper studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $m\in\mathbb{N}$, thus complementing some recently proposed packet-based…

Information Theory · Computer Science 2015-03-13 Claudio Weidmann , Gottfried Lechner

Non-binary linear block codes (NB-LBCs) are an important class of error-correcting codes that are especially competent in correcting burst errors. They have broad applications in modern communications and storage systems. However, efficient…

Information Theory · Computer Science 2026-01-21 Jingyu Lin , Li Chen , Xiaoqian Ye

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that have excellent performance thanks to the degrees of freedom they offer. An SC code is designed by partitioning a base matrix into components, the number…

Information Theory · Computer Science 2026-05-11 Bade Aksoy , Doğukan Özbayrak , Ahmed Hareedy

An erasure code is said to be a code with sequential recovery with parameters $r$ and $t$, if for any $s \leq t$ erased code symbols, there is an $s$-step recovery process in which at each step we recover exactly one erased code symbol by…

Information Theory · Computer Science 2018-01-23 Balaji Srinivasan Babu , Ganesh R. Kini , P. Vijay Kumar

This paper investigates the Triangle Single Parity Check (T/SPC) code, a novel class of high-rate low-complexity LDPC codes. T/SPC is a regular, soft decodable, linear-time encodable/decodable code. Compared to previous high-rate and…

Information Theory · Computer Science 2011-04-11 Damian A. Morero , Graciela Corral-Briones , Carmen Rodriguez , Mario R. Hueda

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Traceability codes are combinatorial objects introduced by Chor, Fiat and Naor in 1994 to be used to trace the origin of digital content in traitor tracing schemes. Let $F$ be an alphabet set of size $q$ and $n$ be a positive integer. A…

Information Theory · Computer Science 2016-02-29 Gennian Ge , Chong Shangguan

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an…

Information Theory · Computer Science 2021-09-21 Siyi Yang , Ahmed Hareedy , Robert Calderbank , Lara Dolecek