Sciweavers

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

31

COMBINATORICS
2002

favoriteEmaildiscussreport

90views more COMBINATORICS 2002»

Ternary Constant Weight Codes

13 years 10 months ago

Ternary Constant Weight Codes

Download www.combinatorics.org

Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d, w) are presented, and a table of exact values and bounds in the range n 10 is given.

Patric R. J. Östergård, Mattias Svanstr

Real-time Traffic

COMBINATORICS 2002 | Maximum Cardinality | Minimum Distance | Ternary Code |

claim paper

Related Content

» On Perfect Ternary Constant Weight Codes

» Linear Size Optimal qary ConstantWeight Codes and ConstantComposition Codes

» On Senary Simplex Codes

» Trellis Structure and Higher Weights of Extremal SelfDual Codes

» Decoding of Ternary Error Correcting Output Codes

» ConstantWeight Gray Codes for Local Rank Modulation

» A New Table of Constant Weight Codes of Length Greater than 28

» New ConstantWeight Codes from Propagation Rules

» New Optimal Constant Weight Codes

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Patric R. J. Östergård, Mattias Svanström

Comments (0)