Results 31 to 40 of about 7,931,944 (349)
Abstract Interpretation of Microcontroller Code: Intervals meet Congruences [PDF]
, 2013 Bitwise instructions, loops and indirect data access present challenges to the verification of microcontroller programs. In particular, since registers are often memory mapped, it is necessary to show that an indirect store operation does not accidently ...
Brauer, Jorg +2 more
core +1 more source
The minimum linear locality of linear codes
CoRR, 2021 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
On Some Families of Codes Related to the Even Linear Codes Meeting the Grey–Rankin Bound
Mathematics, 2022 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
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
The automorphisms and error orbits of Reed – Solomon codes
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2020 The purpose of this work with its results presented in the article was to develop and transfer to the class of Reed – Solomon codes (RS-codes) the basic provisions of the theory of syndrome norms (TNS), previously developed for the noise-resistant coding
S. I. Semyonov, V. A. Lipnitsky
doaj +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
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 +2 more sources
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 +2 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