Results 21 to 30 of about 236,875 (314)
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
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
On the Trifference Problem for Linear Codes
We prove that perfect $3$-hash linear codes in $\mathbb{F}_{3}^{n}$ must have dimension at most $ \left(\frac{1}{4}-ε\right)n$ for some absolute constant $ε> 0$.
Cosmin Pohoata, Dmitriy Zakharov
openaire +2 more sources
New Soft Set Based Class of Linear Algebraic Codes [PDF]
In this paper, we design and develop a new class of linear algebraic codes defined as soft linear algebraic codes using soft sets. The advantage of using these codes is that they have the ability to transmit m-distinct messages to m-set of receivers ...
Kandasamy, W. B. Vasantha +9 more
core +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
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
Line codes are widely used to protect against errors in data transmission and storage systems, to ensure the stability of various cryptographic algorithms and protocols, to protect hidden information from errors in a stegocontainer. One of the classes of
Yury V. Kosolapov +2 more
doaj +1 more source
Graph-Based Codes and Iterative Decoding [PDF]
The field of error correcting codes was revolutionized by the introduction of turbo codes in 1993. These codes demonstrated dramatic performance improvements over any previously known codes, with significantly lower complexity.
Khandekar, Aamod Dinkar
core +1 more source
Design of Non-Adaptive Querying Policies Based on Error Control Coding
This paper designs non-adaptive querying policies (NQPs) for the noisy 20 questions game based on error-correction codes. The querying accuracy of a specific NQP is upper bounded by a function of the minimum distance among its codewords. As a result, the
Shuai Wang +3 more
doaj +1 more source

