Results 11 to 20 of about 107,782 (282)
Over finite local Frobenius non-chain rings of length 5 and nilpotency index 4 and when the length of the code is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ-constacyclic codes is established ...
Castillo-Guillén C. A. +1 more
doaj +1 more source
DNA codes over finite local Frobenius non-chain rings of length 5 and nilpotency index 4
A one to one correspondence between the elements of a finite local Frobenius non-chain ring of length 5 and nilpotency index 4, and k-tuples of DNA codewords is established.
Castillo-Guillén C. A. +1 more
doaj +1 more source
Improving data embedding capacity into Base45 encoded strings
In the context of data hiding reversible embedding of information into printable string encoded data may provide a solution to store extra bits for various applications.
Marco Botta, Davide Cavagnino
doaj +1 more source
New binary and ternary LCD codes [PDF]
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3 ...
Galindo, Carlos +3 more
core +4 more sources
Information-theoretic approach to quantum error correction and reversible measurement [PDF]
Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error-correcting codes, teleportation, and reversing quantum measurements.
Benjamin Schumacher +4 more
core +4 more sources
Reversible DNA codes using skew polynomial rings [PDF]
In this study we determine the structure of reversible DNA codes obtained from skew cyclic codes. We show that the generators of such DNA codes enjoy some special properties. We study the structural properties of such family of codes and we also illustrate our results with examples.
Gürsoy, Fatmanur +2 more
openaire +6 more sources
Decoding Cyclic Codes up to a New Bound on the Minimum Distance [PDF]
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem (BCH) bound and, for some codes, upon the Hartmann-Tzeng (HT) bound. Several Boston bounds are special cases of our bound.
Bezzateev, Sergey +2 more
core +2 more sources
Universal lossless source coding with the Burrows Wheeler transform [PDF]
The Burrows Wheeler transform (1994) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT
Effros, Michelle +3 more
core +2 more sources
Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility
The finite field $\mathbb {F}_{q^\ell }$ of $q^\ell $ elements contains $\mathbb {F}_{q}$ as a subfield. If $\theta \in \mathbb {F}_{q^\ell }$ is of degree $\ell $ over $\mathbb {F}_{q}$ , it can be used to unfold elements of $\mathbb {F}_{q^\
Ramy Taki Eldin, Hajime Matsui
doaj +1 more source
Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning [PDF]
Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant ...
Amy, Matthew +2 more
core +1 more source

