AbstractThe paper gives an upper bound on the size of a q-ary code of length n that has the k-identifiable parent property. One consequence of this bound is that the optimal rate of such a code is determined in many cases when q→∞ with k and n fixed
Given positive integers q, n and d, denote by Aq(n, d) the maximum size of a q-ary code of length n ...
International audienceWe present one upper bound on the size of non-linear codes and its restriction...
AbstractFor a prime power q, let αq be the standard function in the asymptotic theory of codes, that...
The paper gives an upper bound on the size of a q-ary code of length n that has the k-identifiable p...
AbstractThe paper gives an upper bound on the size of a q-ary code of length n that has the k-identi...
If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant ofa an...
AbstractFor a set C of words of length 4 over an alphabet of size n, and for a, b∈C, let D(a, b) be ...
We study codes that have identifiable parent property. Such codes are called IPP codes. Research on ...
AbstractIfCis aq-ary code of lengthnandaandbare two codewords, thencis called a descendant ofaandbif...
We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the a...
Abstract. Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair...
A method for determining an upper bound for the size of a code for a two-access binary erasure chann...
We derive a simple proof, based on information theoretic inequalities, of an upper bound on the larg...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the a...
Given positive integers q, n and d, denote by Aq(n, d) the maximum size of a q-ary code of length n ...
International audienceWe present one upper bound on the size of non-linear codes and its restriction...
AbstractFor a prime power q, let αq be the standard function in the asymptotic theory of codes, that...
The paper gives an upper bound on the size of a q-ary code of length n that has the k-identifiable p...
AbstractThe paper gives an upper bound on the size of a q-ary code of length n that has the k-identi...
If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant ofa an...
AbstractFor a set C of words of length 4 over an alphabet of size n, and for a, b∈C, let D(a, b) be ...
We study codes that have identifiable parent property. Such codes are called IPP codes. Research on ...
AbstractIfCis aq-ary code of lengthnandaandbare two codewords, thencis called a descendant ofaandbif...
We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the a...
Abstract. Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair...
A method for determining an upper bound for the size of a code for a two-access binary erasure chann...
We derive a simple proof, based on information theoretic inequalities, of an upper bound on the larg...
Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most...
We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the a...
Given positive integers q, n and d, denote by Aq(n, d) the maximum size of a q-ary code of length n ...
International audienceWe present one upper bound on the size of non-linear codes and its restriction...
AbstractFor a prime power q, let αq be the standard function in the asymptotic theory of codes, that...
DOI
Add to ORKG