Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

DAM
2010

favoriteEmaildiscussreport

107views more DAM 2010»

Codes from lattice and related graphs, and permutation decoding

13 years 11 months ago

Codes from lattice and related graphs, and permutation decoding

Download www.ces.clemson.edu

Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its line graph, the lattice graph, are examined. The parameters of the codes for all primes are obtained and PD-sets are found for full permutation decoding for all integers n 3.

Jennifer D. Key, Bernardo Gabriel Rodrigues

Real-time Traffic

Complete Bipartite Graph | DAM 2010 | Field Fp | Lattice Graph |

claim paper

Related Content

» Binary codes from rectangular lattice graphs and permutation decoding

» Binary codes from the line graph of the ncube

» The Art of Trellis Decoding Is NPHard

» Binary codes from graphs on triples and permutation decoding

» Trellis Structure and Higher Weights of Extremal SelfDual Codes

» Twoway source coding with a helper

» Dirtypaper trellis codes for watermarking

» Scheduling of dataflow models within the Reconfigurable Video Coding framework

» Uncoveringsbybases for basetransitive permutation groups

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DAM
Authors	Jennifer D. Key, Bernardo Gabriel Rodrigues

Comments (0)