Codes and Xor graph products

Noga Alon, Eyal Lubetzky

Research output: Contribution to journalArticle

Abstract

What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2} n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and clique number, and by introducing two new parameters of a graph G. Both parameters denote limits of series of either clique numbers or independence numbers of the Xor powers of G (normalized appropriately), and while both limits exist, one of the series grows exponentially as the power tends to infinity, while the other grows linearly. As a special case, it follows that f3(n) = Θ(2n ) whereas g3(n)=Θ(n).

Original languageEnglish (US)
Pages (from-to)13-33
Number of pages21
JournalCombinatorica
Volume27
Issue number1
DOIs
StatePublished - Feb 2007

Fingerprint

Graph Products
Hamming distance
Clique number
Independence number
Hamming Distance
Series
Graph in graph theory
Linearly
Odd
Infinity
Tend
Denote

Keywords

  • 05C69
  • 94A15

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Codes and Xor graph products. / Alon, Noga; Lubetzky, Eyal.

In: Combinatorica, Vol. 27, No. 1, 02.2007, p. 13-33.

Research output: Contribution to journalArticle

Alon, Noga ; Lubetzky, Eyal. / Codes and Xor graph products. In: Combinatorica. 2007 ; Vol. 27, No. 1. pp. 13-33.
@article{c319b3b1f8e844e985e4d93572130c46,
title = "Codes and Xor graph products",
abstract = "What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2} n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and clique number, and by introducing two new parameters of a graph G. Both parameters denote limits of series of either clique numbers or independence numbers of the Xor powers of G (normalized appropriately), and while both limits exist, one of the series grows exponentially as the power tends to infinity, while the other grows linearly. As a special case, it follows that f3(n) = Θ(2n ) whereas g3(n)=Θ(n).",
keywords = "05C69, 94A15",
author = "Noga Alon and Eyal Lubetzky",
year = "2007",
month = "2",
doi = "10.1007/s00493-007-0042-5",
language = "English (US)",
volume = "27",
pages = "13--33",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "1",

}

TY - JOUR

T1 - Codes and Xor graph products

AU - Alon, Noga

AU - Lubetzky, Eyal

PY - 2007/2

Y1 - 2007/2

N2 - What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2} n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and clique number, and by introducing two new parameters of a graph G. Both parameters denote limits of series of either clique numbers or independence numbers of the Xor powers of G (normalized appropriately), and while both limits exist, one of the series grows exponentially as the power tends to infinity, while the other grows linearly. As a special case, it follows that f3(n) = Θ(2n ) whereas g3(n)=Θ(n).

AB - What is the maximum possible number, f3(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g3(n), of vectors in {0,1,2} n such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and clique number, and by introducing two new parameters of a graph G. Both parameters denote limits of series of either clique numbers or independence numbers of the Xor powers of G (normalized appropriately), and while both limits exist, one of the series grows exponentially as the power tends to infinity, while the other grows linearly. As a special case, it follows that f3(n) = Θ(2n ) whereas g3(n)=Θ(n).

KW - 05C69

KW - 94A15

UR - http://www.scopus.com/inward/record.url?scp=33847416221&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847416221&partnerID=8YFLogxK

U2 - 10.1007/s00493-007-0042-5

DO - 10.1007/s00493-007-0042-5

M3 - Article

AN - SCOPUS:33847416221

VL - 27

SP - 13

EP - 33

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -