Sciweavers

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

13

ARSCOM
2007

favoriteEmaildiscussreport

76views more ARSCOM 2007»

A New Lower Bound for A(17, 6, 6)

13 years 4 months ago

A New Lower Bound for A(17, 6, 6)

Download www1.spms.ntu.edu.sg

We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.

Yeow Meng Chee

Real-time Traffic

ARSCOM 2007 | Constant Weight | Minimal Distance | Record-breaking Binary Code |

claim paper

Related Content

» New Lower Bounds for Some Multicolored Ramsey Numbers

» New upper and lower bounds for randomized and quantum local search

» New category of ultrathin notchless 6T SRAM cell layout topologies for sub22nm

» Symmetric SumFree Partitions and Lower Bounds for Schur Numbers

» New Maximal Numbers of Equilibria in Bimatrix Games

» On PrimeOrder Elliptic Curves with Embedding Degrees k 3 4 and 6

» LowLatency Nonpredictive Handover Scheme in Mobile IPv6 Environments

» Lower Bounds for the Noisy Broadcast Problem

» Lower Bounds for Quantile Estimation in RandomOrder and Multipass Streaming

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	ARSCOM
Authors	Yeow Meng Chee

Comments (0)