English
Related papers

Related papers: Monomial-Cartesian codes and their duals, with app…

200 papers

Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from…

Information Theory · Computer Science 2016-02-09 Oktay Olmez , Aditya Ramamoorthy

We consider irregular product codes.In this class of codes, each codeword is represented by a matrix. The entries in each row (column) of the matrix should come from a component row (column) code. As opposed to (standard) product codes, we…

Information Theory · Computer Science 2012-06-12 Masoud Alipour , Omid Etesami , Ghid Maatouk , Amin Shokrollahi

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Information Theory · Computer Science 2017-10-16 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…

Combinatorics · Mathematics 2026-03-12 Juliann Geraci , Alexander B. Kunin , Alexandra Seceleanu

This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes give the first example of quantum codes that can correct two or more deletion…

Quantum Physics · Physics 2021-12-17 Taro Shibayama , Manabu Hagiwara

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…

Information Theory · Computer Science 2024-04-09 Gaojun Luo , Lin Sok , Martianus Frederic Ezerman , San Ling

Linear complementary dual (LCD) codes are linear codes which intersect their dual codes trivially, which have been of interest and extensively studied due to their practical applications in computational complexity and information…

Information Theory · Computer Science 2023-02-14 Shitao Li , Minjia Shi , Huizhou Liu

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…

Information Theory · Computer Science 2026-03-09 Kanat Abdukhalikov , Gyanendra K. Verma

A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…

Quantum Physics · Physics 2014-12-16 Yingkai Ouyang

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

Information Theory · Computer Science 2022-07-14 Ted Hurley

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Information Theory · Computer Science 2024-10-24 Puyin Wang , Jinquan Luo

Locally Decodable Codes (LDCs) are error correcting codes that admit efficient decoding of individual message symbols without decoding the entire message. Unfortunately, known LDC constructions offer a sub-optimal trade-off between rate,…

Information Theory · Computer Science 2025-06-18 Jeremiah Blocki , Justin Zhang

Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space…

Quantum Physics · Physics 2008-12-05 Salah A. Aly , Andreas Klappenecker

Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…

Combinatorics · Mathematics 2024-10-09 Miguel Benitez , Siran Chen , Tianhui Han , R. Amzi Jeffs , Kinapal Paguyo , Kevin A. Zhou

A toric quantum error-correcting code construction procedure is presented in this work. A new class of an infinite family of toric quantum codes is provided by constructing a classical cyclic code on the square lattice $\mathbb{Z}_{q}\times…

Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…

Logic · Mathematics 2021-08-25 Donghyun Lim , Martin Ziegler

Cartesian differential categories come equipped with a differential combinator that formalizes the directional derivative from multivariable calculus. Cartesian differential categories provide a categorical semantics of the differential…

Logic in Computer Science · Computer Science 2022-11-04 Jean-Simon Pacaud Lemay

Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have recently been identified to be a technologically viable option for building fault-tolerant quantum computers. The best-known…

Quantum Physics · Physics 2022-06-07 Allan D. C. Tosta , Thiago O. Maciel , Leandro Aolita

The categorified theories known as "doctrines" specify a category equipped with extra structure, analogous to how ordinary theories specify a set with extra structure. We introduce a new framework for doctrines based on double category…

Category Theory · Mathematics 2024-04-09 Michael Lambert , Evan Patterson

Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…

Information Theory · Computer Science 2017-05-30 Ashkan Nikseresht