New upper bounds on codes via association schemes and linear programming

Abstract

Abstract. Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming distance d. Upper and lower bounds on A(n, d) have been a subject for extensive research. In this paper we examine upper bounds on A(n, d) as a special case of bounds on the size of subsets in metric association scheme. We will first obtain general… (More)
DOI: 10.3934/amc.2007.1.173

Topics

  • Presentations referencing similar topics