Výsledky vyhledávání - "Combinatorial coding theory"

Combinatorial Limitations of Average-Radius List-Decoding Autor Guruswami, Venkatesan, Narayanan, Srivatsan

“…We study certain combinatorial aspects of listdecoding, motivated by the exponential gap between the known upper bound (of O(1/γ)) and lower bound (of Ω p…”
Získat plný text

Upper Bound on List-Decoding Radius of Binary Codes Autor Polyanskiy, Yury

“…Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with…”
Získat plný text

What's New and Exciting in Algebraic and Combinatorial Coding Theory? Autor Vardy, Alexander

“…Summary form only given, as follows. We will survey the fi eld of algebraic and combinatorial coding theory, in an attempt to answer the question in the title…”
Získat plný text

Upper bound on list-decoding radius of binary codes Autor Polyanskiy, Yury

“…Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with…”
Získat plný text

Code Based Secret Sharing Schemes: Applied Combinatorial Coding Theory

Získat plný text

An Introduction to Algebraic and Combinatorial Coding Theory Autor Zierler, Neal

Získat plný text

Separable Codes for the Symmetric Multiple-Access Channel Autor D'yachkov, Arkadii, Polyanskii, Nikita, Shchukin, Vladislav, Vorobyev, Ilya

“… The well-known issue of the combinatorial coding theory is to obtain upper and lower bounds on the rate of <inline-formula> <tex-math notation="LaTeX">{s} </tex-math></inline-formula…”
Získat plný text

On-orbit codes of posets and operators in algebra Autor Mesnager, Sihem, Raja, Rameez

“…For a partition μ of a positive integer and a prime p , let A ( p , μ ) be a finite Abelian p -group, and let A ^ ( p , μ ) be its dual group. We define a…”
Získat plný text

Characteristics of invariant weights related to code equivalence over rings Autor Greferath, Marcus, Mc Fadden, Cathy, Zumbrägel, Jens

“… (Proceedings of the Tenth International Workshop in Algebraic and Combinatorial Coding Theory (ACCT-10), pp. 106–111…”
Získat plný text

A Conjecture on Optimal Ternary Linear Codes Autor Kawabata, Daiki, Maruta, Tatsuya

“…We give a conjecture on the achievement of the Griesmer bound for ternary linear codes. We prove that our conjecture is valid for at most 7 dimensions…”
Získat plný text

Optimal Linear Codes Over the Field of Order 7 Autor Nomura, Keita, Maruta, Tatsuya

“…We construct some new linear codes over the field of order 7 to determine the exact value of the minimum length for which a linear code of dimension four with…”
Získat plný text

Binomial moments of the distance distribution: bounds and applications Autor Ashikhmin, A., Barg, A.

“…) identities and in many other problems of combinatorial coding theory. We introduce a linear programming problem for bounding these linear forms from below…”
Získat plný text

DNA codes for additive stem similarity Autor D’yachkov, A. G., Voronina, A. N.

“…We study two new concepts of combinatorial coding theory: additive stem similarity and additive stem distance between q -ary sequences. For q…”
Získat plný text

Separable Codes for the Symmetric Multiple-Access Channel Autor Dyachkov, Arkadii, Polyanskii, Nikita, Shchukin, Vladislav, Vorobyev, Ilya

“…) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower bounds on the rate of s-separable codes for the disj-MAC…”
Získat plný text

Popularity Block Labelling for Steiner Systems Autor Colbourn, Charles J.

“…Ordering the blocks of a design, the point sum of an element is the sum of the indices of blocks containing that element. Block labelling for popularity asks…”
Získat plný text

On Covering Radius of Orthogonal Arrays Autor Boumova, Silvia, Ramaj, Tedis, Stoyanova, Maya

“…We obtain analytically upper bounds for the covering radius of orthogonal arrays (OAs) by investigations of the set of all feasible distance distributions of…”
Získat plný text

New upper bounds on the maximal size of an arc in a projective Hjelmslev plane Autor Honold, Thomas, Kiermaier, Michael, Landjev, Ivan

“…In this paper we present new upper bounds on the size of an arc in the projective Hjelslev planes PHG(2, R), where R is a chain ring of mutilicity index 2…”
Získat plný text

How to apply the rubber method for channels with feedback Autor Deppe, Christian, Maringer, Georg, Lebedev, Vladimir

“…We give an overview of applications of the rubber method. The rubber method is a coding algorithm that was developed in 2005 by Ahlswede, Deppe and Lebedev for…”
Získat plný text

New QC Codes over GF(11) Autor Daskalov, Rumen, Metodieva, Elena

“…A linear code of length n, dimension k and minimum distance d over GF (q) is denoted by [n, k, d] q . One of the main problem in linear coding theory is - for…”
Získat plný text

A Parallel Algorithm for Computing the Weight Spectrum of Binary Linear Codes Autor Pashinska, Maria, Bouyukliev, Iliya

“…We present a parallel SIMD (Single Instruction Multiple Data) algorithm for computing the weight spectrum of binary linear [n,k] codes using GPU (Graphics…”
Získat plný text