Results 51 to 60 of about 773 (112)
Group Homomorphisms as Error Correcting Codes [PDF]
The Electronic Journal of Combinatorics, 2015 We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups $G$ and $H$. We prove some general structural results on how the distance behaves with respect to natural group operations, such as passing to subgroups and quotients, and taking products.
openaire +4 more sources
Quantum Convolutional Error Correction Codes [PDF]
Physical Review A, 1998 I report two general methods to construct quantum convolutional codes for quantum registers with internal $N$ states. Using one of these methods, I construct a quantum convolutional code of rate 1/4 which is able to correct one general quantum error for every eight consecutive quantum registers.
openaire +6 more sources
Elliptic genera from classical error-correcting codes
Journal of High Energy PhysicsWe consider chiral fermionic conformal field theories constructed from classical error-correcting codes and provide a systematic way of computing their elliptic genera.
Kohki Kawabata, Shinichiro Yahagi
doaj +1 more source
Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations
MathematicsPerfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory.
Pedro-José Cazorla García
doaj +1 more source
Voting rules as error-correcting codes
Artificial Intelligence, 2015 We present the first model of optimal voting under adversarial noise. From this viewpoint, voting rules are seen as error-correcting codes: their goal is to correct errors in the input rankings and recover a ranking that is close to the ground truth.
Ariel D. Procaccia +2 more
openaire +1 more source
Blockwise Repeated Burst Error Correcting Linear Codes
Ratio Mathematica, 2010 This paper presents a lower and an upper bound on the number of parity check digits required for a linear code that corrects a single sub-block containing errors which are in the form of 2-repeated bursts of length b or less. An illustration of such kind
B.K. Dass, Surbhi Madan
doaj
Pseudorandom Error-Correcting Codes
We construct pseudorandom error-correcting codes (or simply pseudorandom codes), which are error-correcting codes with the property that any polynomial number of codewords are pseudorandom to any computationally-bounded adversary. Efficient decoding of corrupted codewords is possible with the help of a decoding key.
Miranda Christ, Sam Gunn
openaire +3 more sources
COMPARATIVE ANALYSIS OF LDPC AND BCH CODES ERROR-CORRECTING CAPABILITIES
Information and Telecommunication Sciences, 2014 The error-correcting capabilities of regular LDPC (Low Density Parity Check) codes and BCH (Bose-Chaudhuri-Hocquenguem) codes are examined. The qualitative analysis and the quantitative assessment of error-correcting abilities are performed for LDPC ...
Leonid O. Uryvsky, Serhii O. Osypchuk
doaj +1 more source
Software Approaches and Methods to Ensure the Security of Interactive Systems
Cybernetics and Information Technologies, 2018 In the paper are studied methods for protection of interactive systems and digital archives against unauthorized distribution of digital content. We make an overview of steganographic methods and image protection schemes.
Bogdanova Galina +2 more
doaj +1 more source
The Finite Heisenberg-Weyl Groups in Radar and Communications
EURASIP Journal on Advances in Signal Processing, 2006 We investigate the theory of the finite Heisenberg-Weyl group in relation to the development of adaptive radar and to the construction of spreading sequences and error-correcting codes in communications. We contend that this group can form the basis for
Calderbank AR, Moran W, Howard SD
doaj +1 more source