Sciweavers

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

7

FFA
2006

favoriteEmaildiscussreport

69views more FFA 2006»

Information sets and partial permutation decoding for codes from finite geometries

13 years 4 months ago

Information sets and partial permutation decoding for codes from finite geometries

Download www.ces.clemson.edu

We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors for the codes of the designs of points and hyperplanes over prime fields. Key words: Codes, finite geometries, designs PACS: 05, 51, 94

Jennifer D. Key, T. P. McDonough, Vassili C. Mavro

Real-time Traffic

FFA 2006 | Generalized Reed-muller Codes | Partial Permutation | Prime Fields |

claim paper

Related Content

» Binary codes from the line graph of the ncube

» Scheduling algorithm for partially parallel architecture of LDPC decoder by matrix permuta...

» Binary codes from rectangular lattice graphs and permutation decoding

» Decoding positional and color information from a coded pattern

» InformationGeometrical Significance of Sparsity in Gallager Codes

» Cryptographic Hardness Based on the Decoding of ReedSolomon Codes

» Uncoveringsbybases for basetransitive permutation groups

» LowFloor DetectionDecoding of LDPCCoded Partial Response Channels

» To Feed or Not to Feed Back

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	FFA
Authors	Jennifer D. Key, T. P. McDonough, Vassili C. Mavron

Comments (0)