Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Strengthening the Gilbert-Varshamov bound
Autore:
Barg, A; Guritman, S; Simonis, J;
Indirizzi:
Delft Univ Technol, Fac Informat Technol & Syst, NL-2600 GA Delft, Netherlands Delft Univ Technol Delft Netherlands NL-2600 GA 00 GA Delft, Netherlands Bell Labs, Lucent Technol, Murray Hill, NJ 07974 USA Bell Labs Murray Hill NJ USA 07974 ent Technol, Murray Hill, NJ 07974 USA
Titolo Testata:
LINEAR ALGEBRA AND ITS APPLICATIONS
fascicolo: 1-3, volume: 307, anno: 2000,
pagine: 119 - 129
SICI:
0024-3795(20000301)307:1-3<119:STGB>2.0.ZU;2-X
Fonte:
ISI
Lingua:
ENG
Keywords:
linear code; maximal code; intersection number; lengthening;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Physical, Chemical & Earth Sciences
Citazioni:
13
Recensione:
Indirizzi per estratti:
Indirizzo: Simonis, J Delft Univ Technol, Fac Informat Technol & Syst, POB 5031, NL-2600 GA Delft, Netherlands Delft Univ Technol POB 5031 Delft Netherlands NL-2600 GA lands
Citazione:
A. Barg et al., "Strengthening the Gilbert-Varshamov bound", LIN ALG APP, 307(1-3), 2000, pp. 119-129

Abstract

The paper discusses some ways to strengthen (nonasymptotically) the Gilbert-Varshamov bound for linear codes. The unifying idea is to study a certaingraph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of them known in the literature. (C) 2000 Elsevier Science Inc. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 29/03/20 alle ore 09:10:20