Results 11 to 20 of about 2,120,403 (275)
Lee Weight and Generalized Lee Weight for Codes Over $Z_{2^n}$ [PDF]
Let $\mathbb{Z}_m$ be the ring of integers modulo $m$ in which $m=2^n$ for arbitrary $n$. In this paper, we will obtain a relationship between $wt_L(x), wt_L(y)$ and $wt_L(x+y)$ for any $x, y \in \mathbb{Z}_m$.
Farzaneh Farhang Baftani
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
Error correction by Reed–Solomon codes using its automorphisms
The article explores the syndrome invariants of АГ-group of automorphisms of Reed–Solomon codes (RS-codes) that are a joint group of affine and cyclic permutations. The found real invariants are a set of norms of N Г-orbits that make up one or another АГ-
V. A. Lipnitsky, S. I. Semyonov
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
Linear Codes from Two Weakly Regular Plateaued Balanced Functions
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
Code algebras, axial algebras and VOAs [PDF]
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length $n$.
Castillo-Ramirez, Alonso +2 more
core +3 more sources

