Surrey researchers Sign in
Upper bounds on separating codes
Journal article   Open access  Peer reviewed

Upper bounds on separating codes

Gerard D. Cohen and H. Schaathun
IEEE Transactions on Information Theory, Vol.50(5)
IEEE Transactions on Information Theory
01/06/2004

Abstract

We show how to compute the support weight distribution A/sub i//sup r/ for r/spl ges/k-d/sub 2//sup /spl perp//+3, where d/sub 2//sup /spl perp// is the second minimum support weight of a code, provided the weight enumerator of the dual code is known.

pdf
fulltext93.73 kBDownloadView
Text Open Access

Metrics

487 File views/ downloads
22 Record Views

Details

Usage Policy