Results 31 to 40 of about 5,134,174 (310)
Discrete Mathematics, 1985 Several new and interesting properties of 'linear intersecting codes' are studied. The cyclic structure as well as the duals of such codes are also discussed. Relationships of such codes with many well-known codes in the binary and non-binary cases are established. Almost every study made in the paper is illustrated with an interesting example.
Gérard D. Cohen, Abraham Lempel
openaire +2 more sources
, 2023 MATLAB CODE A) For the Linear-elastic Model - 2 files: E_and_F_vs_h_Varying_R_c.m: Code that calculates the energy and force for various cell radius parameters E_and_F_vs_h_Varying_R_v_and_gp120.m: Code that calculates the energy and force for ...
Thomas Franz (4609669) +3 more
core +1 more source
On Linear Complementary Pairs of Codes [PDF]
IEEE Transactions on Information Theory, 2018 We study linear complementary pairs (LCP) of codes $(C, D)$ , where both codes belong to the same algebraic code family. We especially investigate constacyclic and quasi-cyclic LCP of codes. We obtain characterizations for LCP of constacyclic codes and LCP of quasi-cyclic codes.
Claude Carlet +4 more
openaire +7 more sources
Quasi-linear network coding [PDF]
2014 International Symposium on Network Coding (NetCod), 2014 We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and then quantizing it to a vector non-linear network code using a fixed-point representation.
Moshe Schwartz 0001, Muriel Médard
openaire +4 more sources
On the Covering Dimension of a Linear Code [PDF]
IEEE Transactions on Information Theory, 2016 The critical exponent of a matroid is one of the important parameters in matroid theory and is related to the Rota and Crapo's Critical Problem. This paper introduces the covering dimension of a linear code over a finite field, which is analogous to the critical exponent of a representable matroid.
Britz, T, Shiromoto, K
openaire +3 more sources
How to Find the Equivalence Classes in a Set of Linear Codes in Practice?
MathematicsAn algorithm for equivalence of linear codes over finite fields is presented. Its main advantage is that it can extract exactly one representative from each equivalence class among a large number of linear codes.
Stefka Bouyuklieva, Iliya Bouyukliev
doaj +1 more source
Constant composition codes as subcodes of linear codes [PDF]
Journal of Applied Mathematics and Computing, 2019 13pages
Long Yu, Xiusheng Liu
openaire +3 more sources
The extended codes of some linear codes
Finite Fields and Their ApplicationsThe classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended code of $\C$, is a linear code with parameters $[n+1, k, \bar{d}]$, where $\bar{d}=d$ or $\bar{d}=d+1$.
Zhonghua Sun 0001 +2 more
openaire +5 more sources
Code and data for Linear Program Reconstruction in Practice
, 2020 We briefly report on a successful linear program reconstruction attack performed on a production statistical queries system and using a real dataset. The attack was deployed in test environment in the course of the Aircloak Challenge bug bounty program ...
Aloni Cohen (8305311), Aloni Cohen
core +1 more source
Additive Codes From Linear Codes
IEEE Transactions on Information TheoryWe introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is demonstrably good.
Simeon Ball, Tabriz Popatia
openaire +4 more sources