Titlebook: Coding Theory and Applications; 4th International Ca Raquel Pinto,Paula Rocha Malonek,Paolo Vettori Conference proceedings 2015 Springer In

Enliven

Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codeses on the distinguishability of such codes from random codes using the Schur product. Wieschebrink treated the genus zero case a few years ago but his approach cannot be extent straightforwardly to other genera. We address this problem by introducing and using a new notion, which we call the . of a code.

paltry

On the Fan Associated to a Linear Codedeals are not toric. To this end, the correspondence of linear codes and binomial ideals will be briefly described as well as their resemblance to toric ideals. Finally, we will hint at applications of the degree compatible Gr?bner fan to the code equivalence problem.

彈藥

On Extendibility of Additive Code Isometriesn general, it is not the situation for nonlinear codes. In the paper it was proved, that if the length of an additive code is less than some threshold value, then an analogue of the MacWilliams Extension Theorem holds. One family of unextendible code isometries for the threshold value of code length is described.

小母馬

Ancillary

G. C. Holdren,David E. ArmstrongA new class of cyclic generalized separable (.,?.) codes is constructed.

Confirm

https://doi.org/10.1057/9780230508194We recall why linear codes with complementary duals (LCD codes) play a role in counter-measures to passive and active side-channel analyses on embedded cryptosystems. The rate and the minimum distance of such LCD codes must be as large as possible. We investigate constructions.

偶然

https://doi.org/10.1057/9780230299177In this paper, we present an input-state-output representation of a convolutional product code; we show that this representation is non minimal. Moreover, we introduce a lower bound on the free distance of the convolutional product code in terms of the free distance of the constituent codes.

拾落穗

Hemodialysis

Custodian