Binary codes from graphs on triples and permutation decoding

13 years 4 months ago

Download www.ces.clemson.edu

We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on `n 3

Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R

Real-time Traffic

Adjacency Matrices | ARSCOM 2006 | Explicit Pd-sets | Symmetric Group |

claim paper

» Binary codes from rectangular lattice graphs and permutation decoding

» The Art of Trellis Decoding Is NPHard

» Codes from lattice and related graphs and permutation decoding

» Trellis Structure and Higher Weights of Extremal SelfDual Codes

» How to Achieve a McElieceBased Digital Signature Scheme

» Lowdensity graph codes that are optimal for sourcechannel coding and binning

» Scheduling of dataflow models within the Reconfigurable Video Coding framework

» Twoway source coding with a helper

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2006
Where	ARSCOM
Authors	Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues

Comments (0)

Sciweavers

Binary codes from graphs on triples and permutation decoding

Adjacency Matrices | ARSCOM 2006 | Explicit Pd-sets | Symmetric Group |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers