Results 271 to 280 of about 163,262 (305)
Some of the next articles are maybe not open access.
Coding a and Coding B of the Wisc are Not Equivalent Tasks
Perceptual and Motor Skills, 1978WISC Coding A and Coding B were administered to 50 subjects with minimal brain dysfunction and 75 controls whose ages ranged from 7 yr., 8 mo. and 0 days to 8 yr., 3 mo. and 30 days, with half of each group above 8 and half below. Standard scores showed significant differences between Coding A and Coding B suggesting that the two tasks are nor ...
L, Oettinger, L V, Majovski, R R, Gauch
openaire +2 more sources
On the Equivalence of Codes over Finite Rings
Applicable Algebra in Engineering, Communication and Computing, 2004Let \(R\) be a finite (not necessarily commutative) ring with identity. The authors call \(R\) a `left (right) MacWilliams ring' if for each \(n\geq 1\) and linear code \(C \subseteq R^n\), every left (right) isometry \(C\rightarrow R^n\) extends to a monomial transformation of \(R^n\).
Hai Quang Dinh 0001 +1 more
openaire +2 more sources
Switching Equivalence Classes of Perfect Codes
Designs, Codes and Cryptography, 1999A binary 1-error correcting perfect code is called switching equivalent to the Hamming code (of the same parameters) if there is a sequence of switches (replacing a specially selected set of codewords for another set of words) which leads to the Hamming code. \textit{S. V. Avgustinovich} and \textit{F. I.
Kevin T. Phelps, Mike LeVan
openaire +1 more source
The Equivalence of Certain Harper Codes
Bell System Technical Journal, 1969A class of binary encoding algorithms called Harper codes has been studied previously as a means of encoding numbers for transmission over an idealized binary channel. This paper considers a more general and practical transmission system model. For any Harper code, it presents a technique for obtaining the expression for the average absolute numerical ...
openaire +2 more sources
Testing efficiency transfer codes for equivalence
Applied Radiation and Isotopes, 2010Four 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 +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), 2017We 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 +2 more
openaire +2 more sources
On isometry and equivalence of skew constacyclic codes
Discrete MathematicsThe 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 Ou-azzou +2 more
openaire +2 more sources
Equivalent irreducible Goppa codes (Corresp.)
IEEE Transactions on Information Theory, 1978Irreducible 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
Local Equivalence of Surface Code States
2011Surface 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 +1 more
openaire +1 more source
On the sample complexity of linear code equivalence for all code rates
Cryptography and CommunicationszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alessandro Budroni, Andrea Natale
openaire +2 more sources