Results 21 to 30 of about 5,134,174 (310)
LINEAR CODE THROUGH POLYNOMIAL MODULO Z [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 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
Data and R code supporting: Circular-Linear Copulae for Animal Movement Data
, 2021 See readme file included with the set of files.This repository contains data and R code (along with associated output from running the code) for fitting circular-linear copula to animal location data, supporting results reported in: Hodel, F.
Hodel, Florian, Fieberg, John R
core +1 more source
A note on full weight spectrum codes [PDF]
Transactions on Combinatorics, 2019 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
Maximum Intersection of Linear Codes and Codes Equivalent to Linear
Journal of Applied and Industrial Mathematics, 2019 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
On Weight Spectrum of Linear Codes [PDF]
2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 2021 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 +3 more sources
On the generalized Hamming weights of certain Reed–Muller-type codes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 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
Multi-Receiver Authentication Scheme for General Access Structure
IEEE Access, 2020 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
On the Trifference Problem for Linear Codes
IEEE Transactions on Information Theory, 2022 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 +4 more sources
IEEE Access, 2020 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
Discussiones Mathematicae - General Algebra and Applications, 2017 In this paper, we define linear codes and cyclic codes over a finite Krasner hyperfield and we characterize these codes by their generator matrices and parity check matrices.
Atamewoue Surdive +3 more
doaj +1 more source