Results 11 to 20 of about 2,113,636 (278)
Linear Codes Arise From New Complete (n,r)-arcs in PG(2,29) [PDF]
This paper presents the recently-discovered linear [n,3,d] codes over PG(2,29) that arises from a complete (n,r)-arcs which the paper[12] presented it for the first time.
Shuaa Aziz
doaj +1 more source
On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound
Bounds for the parameters of codes are very important in coding theory. The Grey–Rankin bound refers to the cardinality of a self-complementary binary code. Codes meeting this bound are associated with families of two-weight codes and other combinatorial
Iliya Bouyukliev +2 more
doaj +1 more source
On the generalized Hamming weights of certain Reed–Muller-type codes
There is a nice combinatorial formula of P. Beelen and M. Datta for the r-th generalized Hamming weight of an a ne cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the r-th generalized Hamming weight for a ...
González-Sarabia Manuel +2 more
doaj +1 more source
LINEAR CODE THROUGH POLYNOMIAL MODULO Z [PDF]
A polynomial p(x)= a + a x + …+ a x is said to be a permutation polynomial over a finite ring R If P permute the elements of R . where R is the ring ( Z , + , ) .
MAKARIM ABDULWAHIDE
doaj +1 more source
Multi-Receiver Authentication Scheme for General Access Structure
Authentication is an important primitive of cryptography. With the rapid progress of network communication, the urgent data needs to ensure it integrity and privacy, therefore, the authentication of multi-receiver has a significant impact on the ...
Qiuxia Xu, Chunming Tang, Jingtong Wang
doaj +1 more source
A note on full weight spectrum codes [PDF]
A linear $ [n,k]_q $ code $ C $ is said to be a full weight spectrum (FWS) code if there exist codewords of each weight less than or equal to $ n $. In this brief communication we determine necessary and sufficient conditions for the existence of linear $
Tim Alderson
doaj +1 more source
Let F2(m) be a finite field of 2m elements, λ and k be integers satisfying λ, k ≥ 2 and denote R = F2(m)[u]/(u2λ). Let δ, α ∈ F2(m)×.
Yuan Cao +4 more
doaj +1 more source
Decoding Linear Codes over Chain Rings Given by Parity Check Matrices
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
Constacyclic Codes over Finite Chain Rings of Characteristic p
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
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

