Sciweavers

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

16

COMBINATORICS
1998

favoriteEmaildiscussreport

130views more COMBINATORICS 1998»

Codes and Projective Multisets

13 years 4 months ago

Codes and Projective Multisets

Download www.maths.tcd.ie

The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that transforms projective codes into two-weight codes. Short proofs of known theorems are obtained. A new notion of self-duality in coding theory is explored. 94B05, 94B27, 51E22.

Stefan M. Dodunekov, Juriaan Simonis

Real-time Traffic

BrouwerVan Eupen Construction | COMBINATORICS 1998 | Full-length Linear Codes | Projective Multisets |

claim paper

Related Content

» Duality and Greedy Weights of Linear Codes and Projective Multisets

» Algorithms for Programmers

» Parameters for which the Griesmer bound is not sharp

» On the binary projective codes with dimension 6

» Cardinality Abstraction for Declarative Networking Applications

» The Bosco Project A JMICompliant Templatebased Code Generator

» Foreground Detection Using Spatiotemporal Projection Kernels

» Coprimitive sets and inextendable codes

» Measuring the progress of projects using the time dependence of code changes

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	COMBINATORICS
Authors	Stefan M. Dodunekov, Juriaan Simonis

Comments (0)