Add to ORKGAhlswede R. On code pairs with specified Hamming distances. In: Combinatorics. Colloquia mathematica Societatis János Bolyai. Vol 52. Amsterdam [u.a.]: North Holland Publ. Co. [u.a.]; 1987: 9-47
Salazar, Dunn and Graham in [15] presented an improved Feng-Rao bound for the minimum distance of du...
We characterize Product-MDS pairs of linear codes, i.e. pairs of codes C, D whose product under coor...
The Cadambe-Mazumdar bound gives a necessary condition for a code to have a certain locality in case...
Ahlswede R, Zhang Z. Code pairs with specified parity of the Hamming distances. DISCRETE MATHEMATICS...
AbstractFor code pairs (A, B); A, B ⊂ {0, 1,…, α − 1}″; with mutually constant parity of the Hamming...
Our main discovery is the inequality: If A, B ⊂ {1,..., α}m; m ∈ ℕ; satisfies for the Hamming distan...
1. Two fundamental questions in coding theory Two of the most basic questions in coding theory are: ...
Ahlswede R, Mörs M. Inequalities for code pairs. European Journal of Combinatorics. 1988;9(2):175-18...
Let F n be the set of all 0 − 1 vectors of length n. The Hamming distance, d(u, v) of two vectors u,...
AbstractBy using the dual distance distribution and its properties for binary code C with length n a...
We consider codes in the Hamming association scheme Hn(q) with interesting metric properties. We des...
Let A and B be two binary codes of length n such that all values of the Hamming distance between cod...
We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of code...
AbstractAhlswede and Katona posed the following average distance problem: For every n and 1⩽M⩽2n, de...
AbstractLet x,y be strings of equal length. The Hamming distance h(x,y) between x and y is the numbe...
Salazar, Dunn and Graham in [15] presented an improved Feng-Rao bound for the minimum distance of du...
We characterize Product-MDS pairs of linear codes, i.e. pairs of codes C, D whose product under coor...
The Cadambe-Mazumdar bound gives a necessary condition for a code to have a certain locality in case...
Ahlswede R, Zhang Z. Code pairs with specified parity of the Hamming distances. DISCRETE MATHEMATICS...
AbstractFor code pairs (A, B); A, B ⊂ {0, 1,…, α − 1}″; with mutually constant parity of the Hamming...
Our main discovery is the inequality: If A, B ⊂ {1,..., α}m; m ∈ ℕ; satisfies for the Hamming distan...
1. Two fundamental questions in coding theory Two of the most basic questions in coding theory are: ...
Ahlswede R, Mörs M. Inequalities for code pairs. European Journal of Combinatorics. 1988;9(2):175-18...
Let F n be the set of all 0 − 1 vectors of length n. The Hamming distance, d(u, v) of two vectors u,...
AbstractBy using the dual distance distribution and its properties for binary code C with length n a...
We consider codes in the Hamming association scheme Hn(q) with interesting metric properties. We des...
Let A and B be two binary codes of length n such that all values of the Hamming distance between cod...
We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of code...
AbstractAhlswede and Katona posed the following average distance problem: For every n and 1⩽M⩽2n, de...
AbstractLet x,y be strings of equal length. The Hamming distance h(x,y) between x and y is the numbe...
Salazar, Dunn and Graham in [15] presented an improved Feng-Rao bound for the minimum distance of du...
We characterize Product-MDS pairs of linear codes, i.e. pairs of codes C, D whose product under coor...
The Cadambe-Mazumdar bound gives a necessary condition for a code to have a certain locality in case...