Results 11 to 20 of about 1,011,482 (281)
More Constructions of 3-Weight Linear Codes
Linear codes with few weights have become an interesting research topic and important applications of cryptography and coding theory. In this paper, we apply some ternary near-bent and 2-plateaued functions or r-ary functions to construct more 3-weight ...
Lingyong Ma, Guanjun Li, Fengyan Liu
doaj +1 more source
Fuzzy linear codes based on nested linear codes
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
The minimum linear locality of linear codes
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
A Mathematical Perspective on Post-Quantum Cryptography
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
Linear Codes over Finite Rings
In this paper we present a construction technique of cyclic, BCH, alternat, Goppa and Srivastava codes over a local finite commutative rings with identity.
A.A. de Andrade, R. Palazzo Jr.
doaj +1 more source
Multi-block Two Repeated Fixed Burst Error Correcting Linear Codes
During the digital transmission of information, errors are bound to occur. The errors may be random or burst errors. In this paper, we have obtained necessary and sufficient conditions for the existence of linear codes over that are capable of ...
Ritu Arora +3 more
doaj +1 more source
Linear codes resulting from finite group actions [PDF]
In this article, we use group action theory to define some important ternary linear codes. Some of these codes are self-orthogonal having a minimum distance achieving the lower bound in the previous records. Then, we define two new codes sharing the same
Driss Harzalla
doaj +1 more source
Maximum Intersection of Linear Codes and Codes Equivalent to Linear
Summary: We consider linear codes in a space over a finite field with the Hamming metric. A code is called pseudolinear if it is the image of a linear code under an isometric transformation of the space. We derive an upper bound \((q-2)M/q\) attainable for \(q\geqslant 3\) for the size of the intersection of two different pseudolinear codes of the same
Avgustinovich, Sergeĭ Vladimirovich +1 more
openaire +2 more sources
Zero-error Slepian-Wolf Coding of Confined Correlated Sources with Deviation Symmetry [PDF]
In this paper, we use linear codes to study zero-error Slepian-Wolf coding of a set of sources with deviation symmetry, where the sources are generalization of the Hamming sources over an arbitrary field. We extend our previous codes, Generalized Hamming
Cheng, Samuel, Ma, Rick
core +2 more sources
On Weight Spectrum of Linear Codes [PDF]
We study sequences of linear or affine codes with uniform weight spectrum, i.e., a part of codewords with any fixed weight tends to zero. It is proved that a sequence of linear codes has a uniform weight spectrum if the number of vectors from codes with weight $1$ grows to infinity.
openaire +2 more sources

