Results 11 to 20 of about 216,076 (266)
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
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
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
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
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
Partial IDS decoding based on the base graph of protograph LDPC codes
The residual belief propagation (RBP) algorithm, which is the most classic informed dynamic scheduling strategy, achieves outstanding performance in error correction and can drastically accelerate convergence speed.
Shuo Liang, Xingcheng Liu, Suipeng Xie
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
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
Projective parameterized linear codes
In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals,
González Sarabia Manuel +2 more
doaj +1 more source
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

