Titlebook: Coding Theory and Applications; 5th International Ca ángela I. Barbero,Vitaly Skachek,?yvind Ytrehus Conference proceedings 2017 Springer I

浮雕

gregarious

synovial-joint

Detain

Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints, 3.2]. Among the codes that we construct almost all have parameters as good as the best known codes according to?[.] and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound?[., .] from Gr?bner basis theory and for this purpose w

使糾纏

替代品

Mhc-Molecule

Perigee

制定

Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes,t is how one can express the relative generalized Hamming weights of a pair of codes in terms of intersection properties between the smallest of these codes and subcodes of the largest code. The other result tells how one can find the extended weight polynomials, expressing the number of codewords o

Nostalgia