On equidistant constant weight codes

Authors:
Fang-Wei Fu;Torleiv Kløve;Yuan Luo;Victor K. Wei
Affiliations:
Temasek Laboratories, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Institut für Experimentelle Mathematik, Universität Gesamthochschule Essen, Ellernstraße 29, 45326 Essen, Germany;Department of Information Engineering, The Chinese University of Hono Kong, Shatin, NT, Hong Kong
Venue:
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Year:
2003

Citing 3
Cited 1

Introduction to Coding Theory

Introduction to Coding Theory
On the constructions of constant-weight codes

IEEE Transactions on Information Theory
On the Hamming distance between two i.i.d. random n-tuples over a finite set

IEEE Transactions on Information Theory

Coding theory motivated by relational databases

SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Equidistant constant weight codes are studied in this paper. The dual distance distribution of equidistant constant weight codes is investigated and used to obtain upper bounds on the size of such codes as well as equidistant codes in general.