English
Related papers

Related papers: Error-Trellis Construction for Tailbiting Convolut…

200 papers

This work classifies stabilizer codes by the set of diagonal Clifford gates that can be implemented transversally on them. We show that, for any stabilizer code, its group of diagonal transversal Clifford gates on $\ell$ code blocks must be…

Quantum Physics · Physics 2025-07-15 Shival Dasu , Simon Burton

Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic constructions of LRC codes and derive conditions on the zeros of the code that support the property of…

Information Theory · Computer Science 2020-04-16 Zitan Chen , Alexander Barg

Defects in topologically ordered models have interesting properties that are reminiscent of the anyonic excitations of the models themselves. For example, dislocations in the toric code model are known as twists and possess properties that…

Quantum Physics · Physics 2013-11-27 Benjamin J. Brown , Stephen D. Bartlett , Andrew C. Doherty , Sean D. Barrett

This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs. Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint…

Information Theory · Computer Science 2016-11-18 G. David Forney, , Heide Gluesing-Luerssen

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one…

Information Theory · Computer Science 2017-04-06 Alexander Zhdanov

Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation of memoryless sources are presented and used to motivate a design technique for trellis-encoded source…

Information Theory · Computer Science 2011-02-24 Mark Z. Mao , Robert M. Gray , Tamas Linder

A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization, i.e., a cycle-free realization of the code on the…

Information Theory · Computer Science 2016-11-17 Navin Kashyap

In this paper, we investigate an artificial-intelligence (AI) driven approach to design error correction codes (ECC). Classic error correction code was designed upon coding theory that typically defines code properties (e.g., hamming…

Information Theory · Computer Science 2019-10-31 Lingchen Huang , Huazi Zhang , Rong Li , Yiqun Ge , Jun Wang

Sequential decoding, commonly applied to substitution channels, is a sub-optimal alternative to Viterbi decoding with significantly reduced memory costs. In this work, a sequential decoder for convolutional codes over channels that are…

Information Theory · Computer Science 2026-04-02 Anisha Banerjee , Andreas Lenz , Antonia Wachter-Zeh

This paper investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility. Trimness and properness are dual properties of constraint codes. A linear or group realization with a constraint…

Information Theory · Computer Science 2012-08-31 G. David Forney , Heide Gluesing-Luerssen

Recursive learning -- where models are trained on data generated by previous versions of themselves -- is increasingly common in large language models, autonomous agents, and self-supervised systems. However, standard performance metrics…

Machine Learning · Computer Science 2026-05-20 Zhipeng Zhang

In this paper I explore the entanglement evolution of qubits that are part of a five qubit quantum error correction code subject to various decohering environments. Specifically, I look for possible parallels between the entanglement…

Quantum Physics · Physics 2011-07-25 Yaakov S. Weinstein

Let $F$ be a field of characteristic not 2 or 3. The first Tits construction is a well-known tripling process to construct separable cubic Jordan algebras, especially Albert algebras. We generalize the first Tits construction by choosing…

Rings and Algebras · Mathematics 2024-03-26 Thomas Moran , Susanne Pumpluen

In this paper, we give a generalization on the error correcting capability of twisted centralizer codes obtained from a fixed rank 1 matrix. In particular, we fix the combinatorial matrix which is obtained by getting the linear combination…

Information Theory · Computer Science 2024-11-07 John Ben S. Temones

Quantum error-correcting codes will be the ultimate enabler of a future quantum computing or quantum communication device. This theory forms the cornerstone of practical quantum information theory. We provide several contributions to the…

Quantum Physics · Physics 2011-08-29 Mark M. Wilde

In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several…

Information Theory · Computer Science 2026-05-25 Yanxin Chen , Yanli Wang , Tongjiang Yan

Stabilizer codes form an important class of quantum error correcting codes which have an elegant theory, efficient error detection, and many known examples. Constructing stabilizer codes of length $n$ is equivalent to constructing subspaces…

Quantum Physics · Physics 2018-06-12 Tejas Gandhi , Piyush Kurur , Rajat Mittal

The error-pattern correcting code (EPCC) is incorporated in the design of a turbo equalizer (TE) with aim to correct dominant error events of the inter-symbol interference (ISI) channel at the output of its matching Viterbi detector. By…

Information Theory · Computer Science 2015-03-13 Hakim Alhussien , Jaekyun Moon

We investigate a natural subfamily of twisted linearized Reed--Solomon (TLRS) codes in the sum-rank metric, where the twist is applied only to the constant term. We establish a simple necessary and sufficient condition for these codes to be…

Information Theory · Computer Science 2026-04-29 Sanjit Bhowmick , Kuntal Deka , Edgar Martínez-Moro

In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum…

Quantum Physics · Physics 2015-05-13 David P. DiVincenzo