Zobrazeno 1 - 10
of 203
pro vyhledávání: '"Qi, Yanfeng"'
Sum-rank-metric codes have wide applications in the multishot network coding and the distributed storage. Linearized Reed-Solomon codes, sum-rank BCH codes and their Welch-Berlekamp type decoding algorithms were proposed and studied. They are sum-ran
Externí odkaz:
http://arxiv.org/abs/2311.03619
Let $n=2m$. In the present paper, we study the binomial Boolean functions of the form $$f_{a,b}(x) = \mathrm{Tr}_1^{n}(a x^{2^m-1 }) +\mathrm{Tr}_1^{2}(bx^{\frac{2^n-1}{3} }), $$ where $m$ is an even positive integer, $a\in \mathbb{F}_{2^n}^*$ and $b
Externí odkaz:
http://arxiv.org/abs/2109.13421
Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of characterist
Externí odkaz:
http://arxiv.org/abs/1908.01650
Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding theory. I
Externí odkaz:
http://arxiv.org/abs/1905.08834
BCH codes with efficient encoding and decoding algorithms have many applications in communications, cryptography and combinatorics design. This paper studies a class of linear codes of length $ \frac{q^m-1}{2}$ over $\mathbb{F}_q$ with special trace
Externí odkaz:
http://arxiv.org/abs/1903.06779
Publikováno v:
In Finite Fields and Their Applications June 2023 88
Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD codes. In par
Externí odkaz:
http://arxiv.org/abs/1709.03217
Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual
Externí odkaz:
http://arxiv.org/abs/1707.08789
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection at
Externí odkaz:
http://arxiv.org/abs/1703.04346
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection att
Externí odkaz:
http://arxiv.org/abs/1702.08033