in this article we study a class of graph codes with cyclic code component codes as affine variety...

In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A ( 2 , q ) as the Tanner graph, and we are able to describe the codes succinctly using Gröbner bases.

Upload: anthonyobiora

Post on 18-Dec-2015

218 views

Category:

Documents

6 download

Report

Download

Embed Size (px):

DESCRIPTION

In this article we study a class of graph codes with cyclic code component codes as affine variety codes.docx

TRANSCRIPT

In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane ofA(2,q)as the Tanner graph, and we are able to describe the codes succinctly using Grbner bases.

AFFINE COMBINATIONS IN AFFINE SCHEMEScahierstgdc.com/wp-content/uploads/2018/01/Kock-58-2.pdfGEOMETRIE DIFFERENTIELLE CATEGORIQUES by Anders KOCK AFFINE COMBINATIONS IN AFFINE SCHEMES

Affine-Resistant Watermarking

GR Affine Variation

Affine transformations 1

Invariants to affine transform What is affine transform ?

Affine Transformation. Affine Transformations In this lecture, we will continue with the discussion of the remaining affine transformations and composite

Classical Cryptosystems Shift Ciphers (Caesar) y= x+k (mod 26) Affine Ciphers y=ax+b (mod 26) Vigenere Ciphers codes=(02,14,03,04,18) Substitution Ciphers

Affine Transforms

Géométrie Affine

Affine Transform

Affine Model by Piazzesi

Affine cluster algebras