Results 41 to 50 of about 8,529,401 (324)

Product perfect codes and steganography [PDF]

Digital Signal Processing, 2009
A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established.
Helena Rifà-Pous, Josep Rifà
openaire   +2 more sources

A Modified Approach to Punctured Product Polar Codes

Journal of Telecommunications and Information Technology, 2019
A high-performance polar code introduced as a product polar code can be constructed by concatenating two short length polar codes. The punctured structure of this code was achieved by puncturing one of its constituent codes.
Mohammad Abu Hanif, Sina Vafi
doaj   +1 more source

Limitations on Transversal Gates for Hypergraph Product Codes [PDF]

IEEE Transactions on Information Theory, 2020
In a fault tolerant quantum computer, quantum codes are expected to serve the conflicting purposes of protecting quantum information while also allowing that information to be manipulated by fault-tolerant gates.
Simon Burton, D. Browne
semanticscholar   +1 more source

Original wheat product codes and reclassification.

, 2022
Original wheat product codes and reclassification.
Catherine Brinkley (5248316), Subhashni Raj (12878523), John Ulimwengu (11492207)   +2 more
core   +1 more source

Minimal distances for certain quantum product codes and tensor products of chain complexes [PDF]

, 2020
We use a map to quantum error-correcting codes and a subspace projection to get lower bounds for minimal homological distances in a tensor product of two chain complexes of vector spaces over a finite field.
Weilei Zeng, L. Pryadko
semanticscholar   +1 more source

Matrix-Product Codes over Commutative Rings and Constructions Arising from σ,δ-Codes

Journal of Mathematics, 2021
A well-known lower bound (over finite fields and some special finite commutative rings) on the Hamming distance of a matrix-product code (MPC) is shown to remain valid over any commutative ring R.
Mhammed Boulagouaz, Abdulaziz Deajim
doaj   +1 more source

Robust Locally Testable Codes and Products of Codes

Random Structures & Algorithms, 2004
AbstractWe continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable ...
Eli Ben-Sasson, Madhu Sudan 0001
openaire   +4 more sources

Entanglement-assisted Quantum Reed-Muller Tensor Product Codes [PDF]

Quantum
We present the construction of standard entanglement-assisted (EA) qubit Reed-Muller (RM) codes and their tensor product variants from classical RM codes. We show that the EA RM codes obtained using the CSS construction have zero coding rate and negative
Priya J. Nadkarni, Praveen Jayakumar, Arpit Behera, Shayan Srinivasa Garani   +3 more
doaj   +1 more source

Coding Analog of Superadditivity Using Entanglement-Assisted Quantum Tensor Product Codes Over $\mathbb {F}_{p^k}$

IEEE Transactions on Quantum Engineering, 2020
We provide a procedure to construct entanglement-assisted Calderbank-Shor-Steane (CSS) codes over qudits from the parity check matrices of two classical codes over Fq, where q = pk, p is prime, and k is a positive integer.
Priya J. Nadkarni, Shayan Srinivasa Garani   +1 more
doaj   +1 more source

New stabilizer codes from the construction of dual-containing matrix-product codes

Finite Fields Their Appl., 2020
It is known from the CSS code construction that an [ [ m , 2 k − m , ≥ d ] ] q stabilizer code can be obtained from a (Euclidean) dual-containing [ m , k , d ] q code.
Meng Cao, Jianlian Cui
semanticscholar   +1 more source