Results 281 to 290 of about 4,907,516 (322)

Finding the permutation between equivalent linear codes: the support splitting algorithm

IEEE Transactions on Information Theory, 2000
N. Sendrier
exaly   +2 more sources

Minimal Trellis Modules and Equivalent Convolutional Codes

IEEE Transactions on Information Theory, 2006
Hung-Hua Tang, M. Lin, B. Filho
exaly   +2 more sources

Testing efficiency transfer codes for equivalence

Applied Radiation and Isotopes, 2010
Four general Monte Carlo codes (GEANT3, PENELOPE, MCNP and EGS4) and five dedicated packages for efficiency determination in gamma-ray spectrometry (ANGLE, DETEFF, GESPECOR, ETNA and EFFTRAN) were checked for equivalence by applying them to the calculation of efficiency transfer (ET) factors for a set of well-defined sample parameters, detector ...
T, Vidmar, N, Celik, N, Cornejo Díaz, A, Dlabac, I O B, Ewa, J A, Carrazana González, M, Hult, S, Jovanović, M-C, Lépy, N, Mihaljević, O, Sima, F, Tzika, M, Jurado Vargas, T, Vasilopoulou, G, Vidmar   +14 more
openaire   +2 more sources

A code equivalence between streaming network coding and streaming index coding

2017 IEEE International Symposium on Information Theory (ISIT), 2017
We consider a delay-constrained streaming model for zero-error communications and show that under this model, network coding and index coding problems are code equivalent. That is, any streaming network coding instance can be efficiently mapped to a corresponding acyclic streaming index coding instance such that an index code for the latter can be ...
Wong, Ming Fai, Effros, Michelle, Langberg, Michael   +2 more
openaire   +2 more sources

Equivalent irreducible Goppa codes (Corresp.)

IEEE Transactions on Information Theory, 1978
Irreducible Goppa codes extended with an overall parity check are shown to be cyclic or shortened cyclic codes. The location points of a codeword of the extended irreducible codes can be designated as the points of a finite projective geometry. Bounds on the number of equivalence classes of both irreducible and extended irreducible Goppa codes are ...
openaire   +1 more source

On isometry and equivalence of skew constacyclic codes

Discrete Mathematics
The authors generalize the notion of \(n\)-isometry and \(n\)-equivalence relation introduced by \textit{B. Chen} et al. in [Finite Fields Appl. 18, No. 6, 1217--1231 (2012; Zbl 1272.94089); Discrete Appl. Math. 177, 60--70 (2014; Zbl 1325.94156)] to classify constacyclic codes of length \(n\) over a field \(F_q\), where \(q=p^r\) is a prime power, to ...
Hassan Ouazzou, Mustapha Najmeddine, Nuh Aydin   +2 more
openaire   +2 more sources

Local Equivalence of Surface Code States

2011
Surface code states are an important class of stabilizer states that play a prominent role in quantum information processing. In this paper we show that these states do not contain any counterexamples to the recently disproved LU-LC conjecture. In the process we show that An important consequence of our result is that surface codes do not have any ...
Pradeep Kiran Sarvepalli, Robert Raussendorf   +1 more
openaire   +1 more source

MDS and near-MDS codes via twisted Reed–Solomon codes

Designs, Codes and Cryptography, 2022
Junzhen Sui, Xiaomeng Zhu, Xueying Shi
semanticscholar   +1 more source

MDS or NMDS LCD codes from twisted Reed-Solomon codes

Cryptography and Communications, 2022
Daitao Huang, Q. Yue, Yongfeng Niu
semanticscholar   +1 more source

Multiplier Equivalence Of Cyclic Codes

Proceedings. 1991 IEEE International Symposium on Information Theory, 2005
A multiplier is a permutation of S, given by i -+ ai(mod n) where gcd(a,n) = 1. It is known that if two cyclic codes of prime length p are equivalent, then they must also be multiplier equivalent. We show that this same result holds for cyclic codes of length n whenever (n,d(n)) = 1. Let C and C’ be cyclic codes of length pr with p and T primes, p > T,
W.C. Huffman, V. Job, V. Pless
openaire   +1 more source