On Quantum Codes from Weakly-dual Fec Codes Based on Diagonals on Arrays
نویسندگان
چکیده
We present a design technique for binary weakly-dual codes from which we construct quantum error-correction codes (quantum codes) via the CSS technique. The weakly-dual forward error-correction (FEC) codes are based on diagonals of different slopes on a rectangular η 2 ×η array (type-R array) with η even. Some methods to increase the minimum distance of such codes are presented. Index Terms — quantum error correction, weakly-dual codes, LDPC codes
منابع مشابه
Constacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملBounds for weight distribution of weakly self-dual codes
Upper bounds are given for the weight distribution of binary weakly self–dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on quantum computing. This new approach leads to much simpler proofs for such genre of bounds on the weight distributions of certain classes of codes. Moreover, in ...
متن کاملRésultants de polynômes de Ore et Cryptosystèmes de McEliece sur des Codes Rang faiblement structurés. (Resultants of Ore polynomials and McEliece Cryptosystems based on weakly structured Rank Codes)
Weakly Structured Error Correcting Codes in Rank Metric and their Application to Cryptography The most commonly used encryption techniques in cryptography are based on problems in number theory. Despite their efficiency, they are vulnerable to post-quantum cryptographic attack. Therefore it is relevant to study other types of cryptosystems. In this work we study errorcorrector codes based crypt...
متن کامل