Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach [PDF]
A $q$-ary $(n,k,r)$ locally repairable code (LRC) is an $[n,k,d]$ linear code over $\mathbb{F}_q$ such that every code symbol can be recovered by accessing at most $r$ other code symbols. The well-known Singleton-like bound says that $d \le n-k-\lceil k/r\rceil +2$ and an LRC is said to be optimal if it attains this bound.
Jie Hao +5 more
openaire +3 more sources
Localized statistics decoding for quantum low-density parity-check codes. [PDF]
Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code.
Hillmann T +5 more
europepmc +2 more sources
Ldpc Code Construction using Randomly Permutated Copies of Parity Check Matrix [PDF]
A construction technique is proposed for low-density parity check (LDPC) codes. It uses a base parity check matrix designed from a ran-dom or constructed construction method as Gallager or Quasi-Cyclic LDPC (QC-LDPC) codes in sequence to get codes with ...
Amr lulu, Ammar Abu-Hudrouss
doaj +2 more sources
Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check Matrix [PDF]
Recent developments in the field of deep learning have motivated many researchers to apply these methods to problems in quantum information. Torlai and Melko first proposed a decoder for surface codes based on neural networks. Since then, many other researchers have applied neural networks to study a variety of problems in the context of decoding.
Chinni, Chaitanya +4 more
openaire +4 more sources
Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix [PDF]
An iterative algorithm is presented for soft-input-soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the sum product algorithm (SPA) in conjunction with a binary parity check matrix of the RS code.
Jiang, Jing, Narayanan, Krishna R.
core +7 more sources
Low density parity check codes with semi-randomparity check matrix
A semi-random approach to low density parity check code design is shown to achieve essentially the same performance as an existing method, but with considerably reduced complexity.
null Li Ping +2 more
openaire +2 more sources
ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]
We construct an explicit class of affine permutation matrix low-density parity-check (APM-LDPC) codes based on the array parity-check matrix by using two affine maps f (x) = x-1 and g(x) = 2x-1 on Z_m, where m is an odd prime number, with girth 6 and ...
A. Nassaj, A. R. Naghipour
doaj +1 more source
An improved method for counting 6-cycles in low-density parity-check codes [PDF]
Since their rediscovery in the early 1990s, low-density parity-check (LDPC) codes have become the most popular error-correcting codes owing to their excellent performance. An LDPC code is a linear block code that has a sparse parity-check matrix.
Slimani Djamel, Kaddai Abdellah
doaj +1 more source
Adaptive Audio Steganography Based on Improved Syndrome-Trellis Codes
Syndrome-Trellis Code (STC) is a near-optimal convolutional method for adaptive steganography. Hitherto, the existing adaptive steganography commonly depends on the carefully designed distortion cost function, which controls the embedding position of the
Kaiyu Ying +3 more
doaj +1 more source
Single-step parity check gate set for quantum error correction [PDF]
A key requirement for an effective quantum error correction (QEC) scheme is that the physical qubits have error rates below a certain threshold. The value of this threshold depends on the details of the specific QEC scheme, and its hardware-level ...
Gözde Üstün, A. Morello, S. Devitt
semanticscholar +1 more source

