Unconditional proof of tightness of Johnson bound

Venkatesan Guruswami; Igor Shparlinski

Unconditional proof of tightness of Johnson bound

Venkatesan Guruswami^*, Igor Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

2 Citations (Scopus)

Abstract

A study was performed to prove a slightly weaker bound on L^poly(δ) without making any number-theoretic assumption. It was shown that L^poly(δ≤J(delta;)+γ₀ for a very small absolute constant γ.

Original language	English
Title of host publication	SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Editors	J Schewel
Place of Publication	Philadelphia, PA
Publisher	Society for Industrial and Applied Mathematics Publications
Pages	754-755
Number of pages	2
ISBN (Print)	0898715385
Publication status	Published - 2003
Event	14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) - Baltimore, USA Duration: 12 Jan 2003 → 14 Jan 2003

Conference

Conference	14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)
City	Baltimore, USA
Period	12/01/03 → 14/01/03

Access to Document

http://dl.acm.org/citation.cfm?id=644232

Cite this

@inproceedings{2dce40a56b684d198bd9b43c8e9188c7,

title = "Unconditional proof of tightness of Johnson bound",

abstract = "A study was performed to prove a slightly weaker bound on Lpoly(δ) without making any number-theoretic assumption. It was shown that Lpoly(δ≤J(delta;)+γ0 for a very small absolute constant γ.",

author = "Venkatesan Guruswami and Igor Shparlinski",

year = "2003",

language = "English",

isbn = "0898715385",

pages = "754--755",

editor = "J Schewel",

booktitle = "SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms",

publisher = "Society for Industrial and Applied Mathematics Publications",

address = "United States",

note = "14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) ; Conference date: 12-01-2003 Through 14-01-2003",

}

Guruswami, V & Shparlinski, I 2003, Unconditional proof of tightness of Johnson bound. in J Schewel (ed.), SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics Publications, Philadelphia, PA, pp. 754-755, 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), Baltimore, USA, 12/01/03. <http://dl.acm.org/citation.cfm?id=644232>

Unconditional proof of tightness of Johnson bound. / Guruswami, Venkatesan; Shparlinski, Igor.
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. ed. / J Schewel. Philadelphia, PA: Society for Industrial and Applied Mathematics Publications, 2003. p. 754-755.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

TY - GEN

T1 - Unconditional proof of tightness of Johnson bound

AU - Guruswami, Venkatesan

AU - Shparlinski, Igor

PY - 2003

Y1 - 2003

N2 - A study was performed to prove a slightly weaker bound on Lpoly(δ) without making any number-theoretic assumption. It was shown that Lpoly(δ≤J(delta;)+γ0 for a very small absolute constant γ.

AB - A study was performed to prove a slightly weaker bound on Lpoly(δ) without making any number-theoretic assumption. It was shown that Lpoly(δ≤J(delta;)+γ0 for a very small absolute constant γ.

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

M3 - Conference proceeding contribution

AN - SCOPUS:0038077450

SN - 0898715385

SP - 754

EP - 755

BT - SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

A2 - Schewel, J

PB - Society for Industrial and Applied Mathematics Publications

CY - Philadelphia, PA

T2 - 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)

Y2 - 12 January 2003 through 14 January 2003

ER -

Unconditional proof of tightness of Johnson bound

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this