Results 21 to 30 of about 307,945 (311)
DNA Code from Cyclic and Skew Cyclic Codes over
Entropy, 2023 The main motivation of this work is to study and obtain some reversible and DNA codes of length n with better parameters. Here, we first investigate the structure of cyclic and skew cyclic codes over the chain ring R:=F4[v]/⟨v3⟩.
Om Prakash +4 more
doaj +1 more source
Rank equivalent and rank degenerate skew cyclic codes
, 2016 Two skew cyclic codes can be equivalent for the Hamming metric only if they have the same length, and only the zero code is degenerate. The situation is completely different for the rank metric, where lengths of codes correspond to the number of outgoing
Martínez-Peñas, Umberto
core +1 more source
Cyclic-Coded Integer-Forcing Equalization [PDF]
, 2011 A discrete-time intersymbol interference channel with additive Gaussian noise is considered, where only the receiver has knowledge of the channel impulse response.
Erez, Uri, Ordentlich, Or
core +1 more source
Construction of reversible cyclic codes over 𝔽q + u𝔽q + u2𝔽q
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = 𝔽q +u𝔽q + u2𝔽q, where u3 = 0 mod q.
Rehman Nadeem ur +2 more
doaj +1 more source
IEEE Access, 2022 Delay invariant convolutional network codes (abbreviated DI-CNCs) can guarantee multicast communication at asymptotically optimal rates in networks with any delay profile.
Xubo Zhao, Xiaoping Li
doaj +1 more source
Optimal Linear and Cyclic Locally Repairable Codes over Small Fields
, 2015 We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length.
Yaakobi, Eitan, Zeh, Alexander
core +1 more source
Quasi-Cyclic Codes Via Unfolded Cyclic Codes and Their Reversibility
IEEE Access, 2019 The finite field $\mathbb {F}_{q^\ell }$ of $q^\ell $ elements contains $\mathbb {F}_{q}$ as a subfield. If $\theta \in \mathbb {F}_{q^\ell }$ is of degree $\ell $ over $\mathbb {F}_{q}$ , it can be used to unfold elements of $\mathbb {F}_{q^\
Ramy Taki Eldin, Hajime Matsui
doaj +1 more source
Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code
Tongxin xuebao, 2008 Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code ...
ZHANG Guo-hua, WANG Xin-mei
doaj +2 more sources
Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance
, 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 +2 more sources
Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes
Mathematics, 2023 We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to the well-known BCH bound for cyclic codes.
Adel Alahmadi +2 more
doaj +1 more source