Informations- und Codierungstheorie

Heise, Werner; Quattrocchi, Pasquale

doi:10.1007/978-3-642-78659-4

Cited by 46 publications

(13 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Let P be a set of 15 elements and assume that there exists a 5-antiblocking system A with |A| = g(15, 4, 5) = 10. By Lemma 4, for every point p ∈ P we have r p |A| − g(14, 4, 4) = 3, and x 0 = 0 because of |A| = 10 < 13 = g(14, 4,5). Therefore by Lemma 6 the equations x 2 = 15 − x 3 − x 1 and x 3 − x 1 = 10 hold, hence 10 x 3 12.…”

Section: Proof Letmentioning

confidence: 77%

Antiblocking systems and PD-sets

Kroll

Vincenti

2008

Discrete Mathematics

View full text Add to dashboard Cite

Since the permutation decoding algorithm is more efficient the smaller the size of the PD-set, it is important for the applications to find small PD-sets. A lower bound on the size of a PD-set is given by Gordon. There are examples for PD-sets, but up to now there is no method known to find PD-sets. The question arises whether the Gordon bound is sharp. To handle this problem we introduce the notion of antiblocking system and we show that there are examples where the Gordon bound is not sharp.

show abstract

Section: Proof Letmentioning

confidence: 77%

Antiblocking systems and PD-sets

Kroll

Vincenti

2008

Discrete Mathematics

View full text Add to dashboard Cite

show abstract

“…Приведем некоторые из полученных результатов. Напомним, что (не обязательно линейный) [лД,г/]-код Ж над конечным полем F^ называется оптимальным [7], если |3£| = q k -максимально возможная мощность л-кода с расстоянием d. В соответствии с этим определением введем следующее определение. …”

Section: параметры луповых кодовunclassified

“…[8,7]). В [11][12][13] приведены некоторые результаты о групповых кодах неабелевых групп, главным образом при условии (л, q) = 1 полупростоты группового кольца ¥ q G.…”

unclassified