Results 31 to 40 of about 9,454,079 (375)
On the ideal associated to a linear code [PDF]
Advances in Mathematics of Communications, 2012 This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\mathcal C)$ to an arbitrary linear code.
Irene Marquez Corbella +2 more
semanticscholar +1 more source
Decoding Linear Codes over Chain Rings Given by Parity Check Matrices
Mathematics, 2021 We design a decoding algorithm for linear codes over finite chain rings given by their parity check matrices. It is assumed that decoding algorithms over the residue field are known at each degree of the adic decomposition.
José Gómez-Torrecillas +2 more
doaj +1 more source
Fuzzy linear codes based on nested linear codes
Fuzzy Sets and Systems, 2023 In this paper, we describe a correspondence between a fuzzy linear code and a family of nested linear codes. We also describe the arithmetic of fuzzy linear codes. As a special class of nested linear codes, we consider a family of nested self-orthogonal codes.
openaire +3 more sources
Constacyclic Codes over Finite Chain Rings of Characteristic p
Axioms, 2021 Let R be a finite commutative chain ring of characteristic p with invariants p,r, and k. In this paper, we study λ-constacyclic codes of an arbitrary length N over R, where λ is a unit of R.
Sami Alabiad, Yousef Alkhamees
doaj +1 more source
Minimal Linear Codes Constructed from Sunflowers
Entropy, 2023 Sunflower in coding theory is a class of important subspace codes and can be used to construct linear codes. In this paper, we study the minimality of linear codes over Fq constructed from sunflowers of size s in all cases.
Xia Wu, Wei Lu
doaj +1 more source
The minimum linear locality of linear codes
CoRR, 2021 Locally recoverable codes (LRCs) were proposed for the recovery of data in distributed and cloud storage systems about nine years ago. A lot of progress on the study of LRCs has been made by now. However, there is a lack of general theory on the minimum linear locality of linear codes.
Pan Tan +3 more
openaire +2 more sources
Linear Codes from Two Weakly Regular Plateaued Balanced Functions
Entropy, 2023 Linear codes with a few weights have been extensively studied due to their wide applications in secret sharing schemes, strongly regular graphs, association schemes, and authentication codes.
Shudi Yang, Tonghui Zhang, Ping Li
doaj +1 more source
On the dual code of points and generators on the Hermitian variety H(2n+1,q²) [PDF]
, 2014 We study the dual linear code of points and generators on a non-singular Hermitian variety H(2n + 1, q(2)). We improve the earlier results for n = 2, we solve the minimum distance problem for general n, we classify the n smallest types of code words and ...
De Boeck, Maarten +1 more
core +2 more sources
Syndrome spectrums of error orbits in RS-codes
Системный анализ и прикладная информатика, 2020 This article is devoted to the research of the properties of syndromes of errors in Reed-Solomon codes. RS-codes are built on non-binary alphabets. So, unlike BCH-codes, RS-codes contain an extremely large variety of correctable errors.
V. A. Lipnitski, S. I. Semyonov
doaj +1 more source
Asymptotic Weight Enumerators of Randomly Punctured, Expurgated, and Shortened Code Ensembles [PDF]
, 2009 In this paper, we examine the effect of random puncturing, expurgating, and shortening on the asymptotic weight enumerator of certain linear code ensembles. We begin by discussing the actions of the three alteration methods on individual codes.
Boyle, Elette C., McEliece, Robert J.
core +1 more source