Results 11 to 20 of about 480,328 (233)
Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance
Problems of Information Transmission, 2015 The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and its generalization by Hartmann and Tzeng are lower bounds on the minimum distance of simple-root cyclic codes. We generalize these two bounds to the case of repeated-root cyclic codes and
Ulmschneider, Markus, Zeh, Alexander
core +4 more sources
Some Constacyclic Codes over Finite Chain Rings [PDF]
, 2012 For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes.
Batoul, Aicha +2 more
core +1 more source
Commuting-projector Hamiltonians for chiral topological phases built from parafermions [PDF]
, 2018 We introduce a family of commuting-projector Hamiltonians whose degrees of freedom involve $\mathbb{Z}_{3}$ parafermion zero modes residing in a parent fractional-quantum-Hall fluid.
Alicea, Jason, Son, Jun Ho
core +2 more sources
Quantum Codes Constructed From Repeated-Root Cyclic Codes
Journal of Physics: Conference Series, 2018 In this paper, we use q-cyclotomic cosets modulo n = q − 1 and generator polynomial to describe repeated-root cyclic codes of length N = pαn. We determine the condition under which a repeated-root cyclic code contains its dual code. Then, for q = 2a, we give a class of dual-containing repeated-root cyclic codes.
Ruihu Li +3 more
openaire +1 more source
Repeated-root Constacyclic Codes with Optimal Locality
, 2021 A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distributed storage systems, an erased symbol can be recovered by accessing only a small number of other symbols, and hence alleviating the network resources required during the ...
Zhao, Wei +2 more
openaire +2 more sources
Repeated-root cyclic codes [PDF]
IEEE Transactions on Information Theory, 1991 In the theory of cyclic codes, it is common practice to require that (n,q)=1, where n is the word length and F/sub q/ is the alphabet. It is shown that the even weight subcodes of the shortened binary Hamming codes form a sequence of repeated-root cyclic codes that are optimal.
openaire +1 more source
Fittino, a program for determining MSSM parameters from collider observables using an iterative method [PDF]
, 2005 Provided that Supersymmetry (SUSY) is realized, the Large Hadron Collider (LHC) and the future International Linear Collider (ILC) may provide a wealth of precise data from SUSY processes.
Allanach +17 more
core +1 more source
Uncertainty analysis in the simulation of effective seepage flow through earth dams with the Monte Carlo algorithm and machine learning [PDF]
مدلسازی و مدیریت آب و خاکIntroductionThe cost of building dams is very high and their failure can be hazardous. On the other hand, they are vital for every country as freshwater storage.
Farhoud Kalateh, Milad Kheiry
doaj +1 more source
List decoding of repeated codes [PDF]
, 2013 Assuming that we have a soft-decision list decoding algorithm of a linear code, a new hard-decision list decoding algorithm of its repeated code is proposed in this article. Although repeated codes are not used for encoding data, due to their parameters,
Hernando, Fernando +2 more
core +4 more sources
Algorithms For Extracting Timeliness Graphs [PDF]
, 2010 We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is ...
A. Mostéfaoui +8 more
core +4 more sources