<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Alinaghipour, F.</creatorName>
<affiliation>Shiraz University, Iran</affiliation>
</creator>
<creator>
<creatorName>Ahmadi, B.</creatorName>
<affiliation>Shiraz University, Iran</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Upper bounds for the size of binary codes</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2017</publicationYear>
<relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'> 978-9975-76-247-2</relatedIdentifier>
<dates>
<date dateType='Issued'>2017</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>Any subset C of the group Znq is called a q-ary code of length n. For any element c 2 C, the weight of c, i.e. the number of non-zero entries of c, is denoted by wt(c). The Hamming distance of any two elements c1; c2 2 C is de ned to be dist(c1; c2) = wt(c1-c2). Also the minimum hamming distance of a code C is de ned to be the largest integer d such that for any c1; c2 2 C, we have dist(c1; c2)  d. The maximum size of any q-ary code of length n with minimum Hamming distance d is denoted by Aq(n; d). It this talk, we will provide an overview of a technique which employs representation theory of nite groups as well as some graph theoretical techniques to obtain some upper bounds for A2(n; d).</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>