Results 11 to 20 of about 27,924 (262)
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 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
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 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
Engineering Reports, 2023 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
Reverse-free codes and permutations
Electronic Notes in Discrete Mathematics, 2011 Abstract Two codewords ( a 1 , … , a k ) and ( b 1 , … , b k ) form a reverse-free pair if ( a i , a j ) ≠ ( b j , b i ) holds whenever 1 ⩽ i j ⩽ k are indices such that a i ≠ a j . In a reverse-free code, each pair of codewords is reverse-free. The maximum size
Zoltán Füredi +3 more
openaire +1 more source
A Family of Reversible BCH Codes
CoRR, 2016 Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms as well as their theoretical importance. BCH codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices ...
Shuxing Li, Cunsheng Ding, Hao Liu 0011
openaire +2 more sources
On the code reverse engineering problem [PDF]
2008 IEEE International Symposium on Information Theory, 2008 — This article deals with the problem of quantifying how many noisy codewords have to be eavesdropped in order to reverse engineer a code. The main result of this paper is a lower bound on this quantity and the proof that this number is logarithmic in the length for LDPC codes.
Cluzeau, Mathieu, Tillich, Jean-Pierre
openaire +3 more sources
Reverse–Complement Similarity Codes
Electronic Notes in Discrete Mathematics, 2005 Abstract We discuss a general notion of similarity function between two sequences which is based on their common subsequences. This notion arises in some applications of molecular biology [A.G. D'yachkov, P.L. Erdos, A.J. Macula, V.V. Rykov, D.C. Torney, C.-S. Tung, P.A. Vilenkin, and P.S.
Arkadii G. D'yachkov +3 more
openaire +1 more source
DNA Codes Over the Ring F₄[
IEEE Access, 2020 In this paper, we develop the method for constructing DNA codes of odd length over the finite chain ring $R=\mathbb {F}_{4}[u]/\langle u^{3}\rangle $ , which plays an important role in genetics, bioengineering and DNA computing.
Jie Liu, Hualu Liu
doaj +1 more source
Journal of Magnetic Resonance Open, 2023 In this work, we describe essential tools of linear algebra necessary for calculating the effect of chemical exchange on spin dynamics and polarization transfer in various nuclear magnetic resonance (NMR) experiments.
Jingyan Xu, Danila A. Barskiy
doaj +1 more source
Reverse Differentiation via Predictive Coding
Proceedings of the AAAI Conference on Artificial Intelligence, 2022 Deep learning has redefined AI thanks to the rise of artificial neural networks, which are inspired by neurological networks in the brain. Through the years, this dualism between AI and neuroscience has brought immense benefits to both fields, allowing neural networks to be used in a plethora of applications.
Tommaso Salvatori +4 more
openaire +3 more sources