English
Related papers

Related papers: Self-dual twisted generalized Reed-Solomon codes

200 papers

A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we construct a linear MSRD code over an arbitrary field ${\bf F}_q$…

Information Theory · Computer Science 2022-06-22 Hao Chen

New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…

Information Theory · Computer Science 2025-10-28 Puyin Wang , Wei Liu , Jinquan Luo , Dengxin Zhai

One may write the Maxwell equations in terms of two gauge potentials, one electric and one magnetic, by demanding that their field strengths should be dual to each other. This requirement is the condition of twisted self-duality. It can be…

High Energy Physics - Theory · Physics 2011-07-01 Claudio Bunster , Marc Henneaux

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy

Gabidulin codes, serving as the rank-metric counterpart of Reed-Solomon codes, constitute an important class of maximum rank distance (MRD) codes. However, unlike the fruitful positive results about the list decoding of Reed-Solomon codes,…

Information Theory · Computer Science 2024-04-23 Zeyu Guo , Chaoping Xing , Chen Yuan , Zihan Zhang

Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…

Combinatorics · Mathematics 2021-01-08 Sudipta Mallik , Bahattin Yildiz

In the recent paper entitled "Explicit constructions of MDS self-dual codes" accepted in { IEEE Transactions on Information Theory}, doi: 10.1109/TIT.2019.2954877, the author has constructed families of MDS self-dual codes from genus zero…

Information Theory · Computer Science 2020-05-05 Lin Sok

We establish an equivalence between two important random ensembles of linear codes: random linear codes (RLCs) and random Reed-Solomon (RS) codes. Specifically, we show that these models exhibit identical behavior with respect to key…

Information Theory · Computer Science 2025-11-17 Matan Levi , Jonathan Mosheiff , Nikhil Shagrithaya

In this paper a framework to study the dual of skew cyclic codes is proposed. The transposed Hamming ring extensions are based in the existence of an anti-isomorphism of algebras between skew polynomial rings. Our construction is applied to…

Information Theory · Computer Science 2018-03-02 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

Let $\mathcal{C}$ be a set of $m$ by $n$ matrices over $\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\in \mathcal{C}$. Suppose that $m\leqslant n$. If $\#\mathcal{C}= q^{n(m-d+1)}$, then $\mathcal{C}$ is a…

Combinatorics · Mathematics 2018-05-29 Guglielmo Lunardon , Rocco Trombetti , Yue Zhou

Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls and are associated with symmetries of the anyon model of the…

Quantum Physics · Physics 2020-04-08 T. R. Scruby , D. E. Browne

In $D=2+1$ dimensions there are two dual descriptions of parity singlets of helicity $\pm 1$, namely the self-dual model of first-order (in derivatives) and the Maxwell-Chern-Simons theory of second-order. Correspondingly, for helicity $\pm…

High Energy Physics - Theory · Physics 2010-12-13 D. Dalmazi , Elias L. Mendonça

Starting from a generalization of a recent result on self-duality we systematically analyze self-dual models. We find a criterion to judge whether a given model is self-dual or not. With this tool we construct some new self-dual pairs,…

High Energy Physics - Theory · Physics 2009-10-30 Andreas Karch

Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…

Information Theory · Computer Science 2024-12-03 S. Venkitesh

We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the…

Optimization and Control · Mathematics 2023-10-20 João Gouveia , Bruno F. Lourenço

This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…

Information Theory · Computer Science 2022-08-09 Sebastian Heri , Julia Lieb , Joachim Rosenthal

In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the…

Information Theory · Computer Science 2012-07-17 Kenza Guenda , T. Aaron Gulliver

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…

Combinatorics · Mathematics 2007-07-16 E. M. Rains , N. J. A. Sloane

We introduce Generalized Skew Multivariate Goppa codes relying on the theory of multivariate Ore polynomials. These codes contain, as a particular case, the Generalized Skew Goppa codes. By providing a new parity check matrix for the…

Information Theory · Computer Science 2026-05-12 Elena Berardini , Pranav Trivedi

Generalized Reed-Solomon (RS) codes are a common choice for efficient, reliable error correction in memory and communications systems. These codes add $2t$ extra parity symbols to a block of memory, and can efficiently and reliably correct…

Information Theory · Computer Science 2024-05-28 Mike Hamburg , Eric Linstadt , Danny Moore , Thomas Vogelsang