Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
812
result(s) for
"Error-correcting codes (Information theory)"
Sort by:
High-speed decoders for polar codes
A new class of provably capacity achieving error-correction codes, polar codes are suitable for many problems, such as lossless and lossy source coding, problems with side information, multiple access channel, etc. The first comprehensive book on the implementation of decoders for polar codes, the authors take a tutorial approach to explain the practical decoder implementation challenges and trade-offs in either software or hardware. They also demonstrate new trade-offs in latency, throughput, and complexity in software implementations for high-performance computing and GPGPUs, and hardware implementations using custom processing elements, full-custom application-specific integrated circuits (ASICs), and field-programmable-gate arrays (FPGAs). Presenting a good overview of this research area and future directions, High-Speed Decoders for Polar Codes is perfect for any researcher or SDR practitioner looking into implementing efficient decoders for polar codes, as well as students and professors in a modern error correction class. As polar codes have been accepted to protect the control channel in the next-generation mobile communication standard (5G) developed by the 3GPP, the audience includes engineers who will have to implement decoders for such codes and hardware engineers designing the backbone of communication networks.
Book
Constructions of good entanglement-assisted quantum error correcting codes
Entanglement-assisted quantum error correcting codes (EAQECCs) are a simple and fundamental class of codes. They allow for the construction of quantum codes from classical codes by relaxing the duality condition and using pre-shared entanglement between the sender and receiver. However, in general it is not easy to determine the number of shared pairs required to construct an EAQECC. In this paper, we show that this number is related to the hull of the classical code. Using this fact, we give methods to construct EAQECCs requiring desirable amounts of entanglement. This allows for designing families of EAQECCs with good error performance. Moreover, we construct maximal entanglement EAQECCs from LCD codes. Finally, we prove the existence of asymptotically good EAQECCs in the odd characteristic case.
Journal Article
Linear ℓ-intersection pairs of codes and their applications
In this paper, a linear ℓ -intersection pair of codes is introduced as a generalization of linear complementary pairs of codes. Two linear codes are said to be a linear ℓ -intersection pair if their intersection has dimension ℓ . Characterizations and constructions of such pairs of codes are given in terms of the corresponding generator and parity-check matrices. Linear ℓ -intersection pairs of MDS codes over Fq of length up to q+1 are given for all possible parameters. As an application, linear ℓ -intersection pairs of codes are used to construct entanglement-assisted quantum error correcting codes. This provides a large number of new MDS entanglement-assisted quantum error correcting codes.
Journal Article
Algebra and coding theory : virtual conference in honor of Tariq Rizvi, Noncommutative rings and their Applications VII, July 5-7, 2021, Université d'Artois, Lens, France ; virtual conference on Quadratic forms, rings and codes, July 8, 2021, Université d'Artois, Lens, France
This volume contains the proceedings of the Virtual Conference on Noncommutative Rings and their Applications VII, in honor of Tariq Rizvi, held from July 5-7, 2021, and the Virtual Conference on Quadratic Forms, Rings and Codes, held on July 8, 2021, both of which were hosted by the Universite d'Artois, Lens, France.The articles cover topics in commutative and noncommutative algebra and applications to coding theory. In some papers, applications of Frobenius rings, the skew group rings, and iterated Ore extensions to coding theory are discussed. Other papers discuss classical topics, such as Utumi rings, Baer rings, nil and nilpotent algebras, and Brauer groups. Still other articles are devoted to various aspects of the elementwise study for rings and modules. Lastly, this volume includes papers dealing with questions in homological algebra and lattice theory. The articles in this volume show the vivacity of the research of noncommutative rings and its influence on other subjects.
eBook
New constructions of entanglement-assisted quantum codes
We present two new constructions of entanglement-assisted quantum error-correcting codes using some fundamental properties of (classical) linear codes in an effective way. The main ideas include linear complementary dual codes and related concatenation constructions. Numerical examples in modest lengths show that our constructions perform better than known constructions in the literature. We also give a proof on a generalization of binary Singleton type bound on entanglement-assisted quantum error-correcting codes to arbitrary q-ary entanglement-assisted quantum error-correcting codes.
Journal Article
New Galois Hulls of GRS Codes and Application to EAQECCs
Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes of (extended) generalized Reed-Solomon (GRS) codes with Galois hulls of arbitrary dimensions. We also propose a general method on constructing GRS codes with Galois hulls of arbitrary dimensions from special Euclidean orthogonal GRS codes. Finally, we construct several new families of entanglement-assisted quantum error-correcting codes (EAQECCs) and MDS EAQECCs by utilizing the above results.
Journal Article
Holographic Renyi entropy from quantum error correction
A
bstract
We study Renyi entropies
S
n
in quantum error correcting codes and compare the answer to the cosmic brane prescription for computing
S
˜
n
≡
n
2
∂
n
n
−
1
n
S
n
. We find that general operator algebra codes have a similar, more general prescription. Notably, for the AdS/CFT code to match the specific cosmic brane prescription, the code must have maximal entanglement within eigenspaces of the area operator. This gives us an improved definition of the area operator, and establishes a stronger connection between the Ryu-Takayanagi area term and the edge modes in lattice gauge theory. We also propose a new interpretation of existing holographic tensor networks as area eigenstates instead of smooth geometries. This interpretation would explain why tensor networks have historically had trouble modeling the Renyi entropy spectrum of holographic CFTs, and it suggests a method to construct holographic networks with the correct spectrum.
Journal Article
MDS linear codes with one-dimensional hull
The hull of a linear code C is the intersection of C with its dual C⊥, where the dual is often defined with respect to Euclidean or Hermitian inner product. The Euclidean hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the automorphism group of a linear code and for checking permutation equivalence of two linear codes. Recently, both Euclidean and Hermitian hulls have found another application to quantum error correcting codes with entanglements. This paper aims to explore explicit constructions of families of MDS linear codes with one-dimensional hull for both cases. We use tools from algebraic function fields in one variable to study such codes. Sufficient conditions for an algebraic geometry code of genus zero to have one-dimensional hull are provided, and some construction methods are presented. We construct many families of MDS linear codes with one-dimensional hull for the Euclidean case and three families for the Hermitian case, respectively.
Journal Article
Linear codes using skew polynomials with automorphisms and derivations
In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an automorphism. Extending the approach of Gabidulin codes, we introduce new notions of evaluation of skew polynomials with derivations and the corresponding evaluation codes. We propose several approaches to generalize Reed-Solomon and BCH codes to module skew codes and for two classes we show that the dual of such a Reed-Solomon type skew code is an evaluation skew code. We generalize a decoding algorithm due to Gabidulin for the rank metric and derive families of Maximum Distance Separable and Maximum Rank Distance codes.
Journal Article
Structure of CSS and CSS-T quantum codes
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction capability, showing that such pairs are easy to produce with a randomized construction. We then prove that CSS-T codes exhibit the opposite behaviour, showing also that, under very natural assumptions, their rate and relative distance cannot be simultaneously large. This partially answers an open question on the feasible parameters of CSS-T codes. We conclude with a simple construction of CSS-T codes from Hermitian curves. The paper also offers a concise introduction to CSS and CSS-T codes from the point of view of classical coding theory.
Journal Article