The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle

A. R. Calderbank, P. Frankl, R. L. Graham, W. C.W. Li, L. A. Shepp

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

Shannon introduced the concept of zero-error capacity of a discrete memoryless channel. The channel determines an undirected graph on the symbol alphabet, where adjacency means that symbols cannot be confused at the receiver. The zero-error or Shannon capacity is an invariant of this graph. Gargano, Körner, and Vaccaro have recently extended the concept of Shannon capacity to directed graphs. Their generalization of Shannon capacity is called Sperner capacity. We resolve a problem posed by these authors by giving the first example (the two orientations of the triangle) of a graph where the Sperner capacity depends on the orientations of the edges. Sperner capacity seems to be achieved by nonlinear codes, whereas Shannon capacity seems to be attainable by linear codes. In particular, linear codes do not achieve Sperner capacity for the cyclic triangle. We use Fourier analysis or linear programming to obtain the best upper bounds for linear codes. The bounds for unrestricted codes are obtained from rank arguments, eigenvalue interlacing inequalities and polynomial algebra. The statement of the cyclic q-gon problem is very simple: what is the maximum size Nq(n) of a subset Sn of {0, 1, (Formula presented.), q−1}n with the property that for every pair of distinct vectors x = (xi), y = (yi) (Formula presented.)Sn, we have xj−yj ≡ 1(mod q) for some j? For q = 3 (the cyclic triangle), we show N3(n)≃2n. If however Sn is a subgroup, then we give a simple proof that (Formula presented.).

Original languageEnglish (US)
Pages (from-to)31-48
Number of pages18
JournalJournal of Algebraic Combinatorics: An International Journal
Volume2
Issue number1
DOIs
StatePublished - Mar 1993

Fingerprint

Cyclic triangles
Linear Codes
Interlacing
Polynomial Algebra
Fourier Analysis
Adjacency
Zero
Graph in graph theory
Undirected Graph
Directed Graph
Linear programming
Triangle
Resolve

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Discrete Mathematics and Combinatorics

Cite this

Calderbank, A. R. ; Frankl, P. ; Graham, R. L. ; Li, W. C.W. ; Shepp, L. A. / The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle. In: Journal of Algebraic Combinatorics: An International Journal. 1993 ; Vol. 2, No. 1. pp. 31-48.
@article{82e35f11590a477095c46ff8779b2fcb,
title = "The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle",
abstract = "Shannon introduced the concept of zero-error capacity of a discrete memoryless channel. The channel determines an undirected graph on the symbol alphabet, where adjacency means that symbols cannot be confused at the receiver. The zero-error or Shannon capacity is an invariant of this graph. Gargano, K{\"o}rner, and Vaccaro have recently extended the concept of Shannon capacity to directed graphs. Their generalization of Shannon capacity is called Sperner capacity. We resolve a problem posed by these authors by giving the first example (the two orientations of the triangle) of a graph where the Sperner capacity depends on the orientations of the edges. Sperner capacity seems to be achieved by nonlinear codes, whereas Shannon capacity seems to be attainable by linear codes. In particular, linear codes do not achieve Sperner capacity for the cyclic triangle. We use Fourier analysis or linear programming to obtain the best upper bounds for linear codes. The bounds for unrestricted codes are obtained from rank arguments, eigenvalue interlacing inequalities and polynomial algebra. The statement of the cyclic q-gon problem is very simple: what is the maximum size Nq(n) of a subset Sn of {0, 1, (Formula presented.), q−1}n with the property that for every pair of distinct vectors x = (xi), y = (yi) (Formula presented.)Sn, we have xj−yj ≡ 1(mod q) for some j? For q = 3 (the cyclic triangle), we show N3(n)≃2n. If however Sn is a subgroup, then we give a simple proof that (Formula presented.).",
author = "Calderbank, {A. R.} and P. Frankl and Graham, {R. L.} and Li, {W. C.W.} and Shepp, {L. A.}",
year = "1993",
month = "3",
doi = "10.1023/A:1022424630332",
language = "English (US)",
volume = "2",
pages = "31--48",
journal = "Journal of Algebraic Combinatorics",
issn = "0925-9899",
publisher = "Springer Netherlands",
number = "1",

}

The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle. / Calderbank, A. R.; Frankl, P.; Graham, R. L.; Li, W. C.W.; Shepp, L. A.

In: Journal of Algebraic Combinatorics: An International Journal, Vol. 2, No. 1, 03.1993, p. 31-48.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle

AU - Calderbank, A. R.

AU - Frankl, P.

AU - Graham, R. L.

AU - Li, W. C.W.

AU - Shepp, L. A.

PY - 1993/3

Y1 - 1993/3

N2 - Shannon introduced the concept of zero-error capacity of a discrete memoryless channel. The channel determines an undirected graph on the symbol alphabet, where adjacency means that symbols cannot be confused at the receiver. The zero-error or Shannon capacity is an invariant of this graph. Gargano, Körner, and Vaccaro have recently extended the concept of Shannon capacity to directed graphs. Their generalization of Shannon capacity is called Sperner capacity. We resolve a problem posed by these authors by giving the first example (the two orientations of the triangle) of a graph where the Sperner capacity depends on the orientations of the edges. Sperner capacity seems to be achieved by nonlinear codes, whereas Shannon capacity seems to be attainable by linear codes. In particular, linear codes do not achieve Sperner capacity for the cyclic triangle. We use Fourier analysis or linear programming to obtain the best upper bounds for linear codes. The bounds for unrestricted codes are obtained from rank arguments, eigenvalue interlacing inequalities and polynomial algebra. The statement of the cyclic q-gon problem is very simple: what is the maximum size Nq(n) of a subset Sn of {0, 1, (Formula presented.), q−1}n with the property that for every pair of distinct vectors x = (xi), y = (yi) (Formula presented.)Sn, we have xj−yj ≡ 1(mod q) for some j? For q = 3 (the cyclic triangle), we show N3(n)≃2n. If however Sn is a subgroup, then we give a simple proof that (Formula presented.).

AB - Shannon introduced the concept of zero-error capacity of a discrete memoryless channel. The channel determines an undirected graph on the symbol alphabet, where adjacency means that symbols cannot be confused at the receiver. The zero-error or Shannon capacity is an invariant of this graph. Gargano, Körner, and Vaccaro have recently extended the concept of Shannon capacity to directed graphs. Their generalization of Shannon capacity is called Sperner capacity. We resolve a problem posed by these authors by giving the first example (the two orientations of the triangle) of a graph where the Sperner capacity depends on the orientations of the edges. Sperner capacity seems to be achieved by nonlinear codes, whereas Shannon capacity seems to be attainable by linear codes. In particular, linear codes do not achieve Sperner capacity for the cyclic triangle. We use Fourier analysis or linear programming to obtain the best upper bounds for linear codes. The bounds for unrestricted codes are obtained from rank arguments, eigenvalue interlacing inequalities and polynomial algebra. The statement of the cyclic q-gon problem is very simple: what is the maximum size Nq(n) of a subset Sn of {0, 1, (Formula presented.), q−1}n with the property that for every pair of distinct vectors x = (xi), y = (yi) (Formula presented.)Sn, we have xj−yj ≡ 1(mod q) for some j? For q = 3 (the cyclic triangle), we show N3(n)≃2n. If however Sn is a subgroup, then we give a simple proof that (Formula presented.).

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

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

U2 - 10.1023/A:1022424630332

DO - 10.1023/A:1022424630332

M3 - Article

AN - SCOPUS:0042973447

VL - 2

SP - 31

EP - 48

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

SN - 0925-9899

IS - 1

ER -