Results 31 to 40 of about 236,875 (314)

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   +3 more sources

Linear intersecting codes

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   +1 more source

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

Optimal Linear Codes and Their Hulls

Mathematics
The hull of a linear code C is the intersection of C with its dual code. The goal is to study the dimensions of the hulls of optimal binary and ternary linear codes for a given length and dimension.
Stefka Bouyuklieva, Mariya Dzhumalieva-Stoeva   +1 more
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   +2 more sources

Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes [PDF]

, 2011
In this paper, we propose an algorithm for designing the interleavers of Serially Concatenated Codes (SCCs), in order to increase the Minimum Hamming Distance (MHD) between the legitimate permutations of the encoded bit sequence and hence to improve the ...
R. G. Maunder, L. Hanzo, Hanzo, L., Maunder, R. G.   +3 more
core   +1 more source

Linear Codes and Self-Polarity

Mathematics
This work studies projective self-dual (PSD) and self-polar linear codes over finite fields with q elements, where q is a power of a prime. The possible parameters for which PSD codes may exist are presented, and many examples are provided.
Iliya Bouyukliev, Stefka Bouyuklieva, Mariya Dzhumalieva-Stoeva, Dushan Bikov   +3 more
doaj   +1 more source

CODING IN GRAPHS AND LINEAR ORDERINGS [PDF]

The Journal of Symbolic Logic, 2020
AbstractThere is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs (see [15]). Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$ , these formulas interpret $\mathcal {A}$ in $\Phi (\mathcal {A})$ .
Julia F. Knight, Alexandra A. Soskova, Stefan V. Vatev   +2 more
openaire   +3 more sources

Irregular Precoder-Aided Differential Linear Dispersion Codes

, 2008
—In this treatise, we propose a novel family of serial concatenated IrRegular Convolutional Coded (IRCC) IrRegular Precoded Differential Linear Dispersion Codes (IR-PDLDC).
Nan Wu, Wu, N, Hanzo, L, Lajos Hanzo
core   +1 more source

The extended codes of some linear codes

Finite Fields and Their Applications
The 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, Cunsheng Ding, Tingfang Chen   +2 more
openaire   +3 more sources