Titlebook: Cryptography and Coding; 12th IMA Internation Matthew G. Parker Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 Code.DES

表示向下

palette

Greedy Recommending Is Not Always Optimal,Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.

Allege

解凍

On the Classification of Self-dual ,-CodesA classification of self-dual .-codes of modest lengths is known for small .. For .?=?4,6,8,9 and 10, the classification of self-dual .-codes is extended to lengths 19,12,12,12 and 10, respectively, by considering .-frames of unimodular lattices.

前奏曲

On Linear Codes from Maximal CurvesSome linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.

BLOT

神經(jīng)

制定法律

neutrophils

共棲

Eric M. Anderman,Tim Urdan,Robert Roeser of correcting adversarial packet insertions in linear network coding. The construction of lifted rank-metric codes is reviewed, along with improved constructions leading to codes with strictly more codewords. Algorithms for encoding and decoding are also briefly described.