Results 11 to 20 of about 103,237 (307)
IEEE Transactions on Information Theory, 2018 In addition to their applications in data communication and storage, linear codes also have nice applications in combinatorics and cryptography. Minimal linear codes, a special type of linear codes, are preferred in secret sharing.
Ding, Cunsheng +5 more
core +3 more sources
A graphical representation of binary linear codes
CoRR, 2022 A binary $[n,k]$-linear code $\mathcal{C}$ is a $k$-dimensional subspace of $\mathbb{F}_2^n$. For $\boldsymbol{x}\in \mathbb{F}_2^n$, the set $\boldsymbol{x}+\mathcal{C}$ is a coset of $\mathcal{C}$. In this work we study a partial ordering on the set of
Holguín-Villa, Alexander +2 more
core +2 more sources
The linear programming bound for binary linear codes
IEEE Transactions on Information Theory, 1993 Combining Delsarte's (1973) linear programming bound with the information that certain weights cannot occur, new upper bounds for dmin (n,k), the maximum possible minimum distance of a binary linear code with given word length n and dimension k, are ...
Brouwer, A.E.
core +4 more sources
IEEE Trans. Inf. Theory, 1987 Using some known techniques, several new binary linear codes are constructed, i.e., codes with a greater minimum distance than any previously known binary code of the same length and dimension [8].
Tolhuizen, L.M.G.M.
core +2 more sources
Quaternary Linear Codes and Related Binary Subfield Codes [PDF]
IEEE Transactions on Information Theory, 2022 24 pages, to appear in IEEE ...
Yansheng Wu, Chengju Li, Fu Xiao 0001
openaire +2 more sources
Binary linear codes, dimers and hypermatrices [PDF]
Electronic Notes in Discrete Mathematics, 2017 To appear in the proceedings of 10th Random Generation of Combinatorial Structures (GASCom) (2016).
Martin Loebl, Pavel Rytír
openaire +2 more sources
Entropy, 2023 Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension/length profile, can be used to ...
Morteza Shoushtari, Willie Harrison
doaj +1 more source
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
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
Binary linear complementary dual codes [PDF]
Cryptography and Communications, 2018 28 ...
Masaaki Harada, Ken Saito
openaire +3 more sources