Results 1 to 10 of about 29,101,112 (306)
M-theory cosmology, octonions, error correcting codes [PDF]
We study M-theory compactified on twisted 7-tori with G 2-holonomy. The effective 4d supergravity has 7 chiral multiplets, each with a unit logarithmic Kähler potential.
Murat Gunaydin +3 more
doaj +4 more sources
M-PSK Cooperative Trellis Codes for Coordinate Interleaved Coded Cooperation
M-PSK cooperative trellis codes are proposed for two-user coordinate interleaved coded cooperation operating over quasistatic Rayleigh fading channels.
Oruç Özgür +1 more
doaj +5 more sources
Double circulant codes for the Lee and Euclidean distance
This paper investigates double circulant codes of length $ 2n $ over $ \mathbb{Z}_{{{p^m}}} $ where $ p $ is an odd prime, $ n $ goes to infinity, and $ m\ge 1 $ is a fixed integer. Using random coding, we obtain families of asymptotically good Lee codes
Adel Alahmadi +4 more
doaj +1 more source
Codes from $m$-ary $n$-cubes $Q^m_n$: a survey [PDF]
We collect together some known results concerning the codes from adjacency matrices of the graph with vertices the nodes of the $m$-ary $n$-cube $Q^m_n$ and with adjacency defined by the Lee metric, and include some new results.
Jennifer Key, Bernardo Rodrigues
doaj +1 more source
Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2
Let p be an odd prime, and Fp(m) is the finite field of pm elements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2ps over Fp(m) are established.
Hai Q. Dinh +2 more
doaj +1 more source
MDS Constacyclic Codes and MDS Symbol-Pair Constacyclic Codes
Symbol-pair codes are used to protect against symbol-pair errors in high density data storage systems. One of the most important tasks in symbol-pair coding theory is to design MDS codes.
Hai Q. Dinh +3 more
doaj +1 more source
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length $6p^{s}$ over $\mathbb F_{p^{m}}$ .
Hai Q. Dinh +3 more
doaj +1 more source
Polyphase alternating codes [PDF]
We present a new class of alternating codes. Instead of the customary binary phase codes, the new codes utilize either p or p–1 phases, where p is a prime number. The first class of codes has code length pm, where m is a positive integer, the second
M. Markkanen, J. Vierinen, J. Markkanen
doaj +1 more source
Families of nested completely regular codes and distance-regular graphs [PDF]
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended binary) Hamming ...
Borges, J., Rifà, J., Zinoviev, V. A.
core +5 more sources
Efficient m-ary balanced codes
This paper, presents new efficient \(m\)-ary balanced code designs which for all values of \(m\geq 2\), improve the redundancy of all the codes mentioned above. To design these codes , the information words which are close to be balanced are encoded using single maps obtained by a new generalization of Knuth's complementation method to the \(m\)-ary ...
TALLINI, Luca, U. VACCARO
openaire +2 more sources

