Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Improved bounds for ternary linear codes of dimension 8 using tabu search
Autore:
Gulliver, TA; Ostergard, PRJ;
Indirizzi:
Univ Canterbury, Dept Elect & Elect Engn, Christchurch 1, New Zealand UnivCanterbury Christchurch New Zealand 1 , Christchurch 1, New Zealand Helsinki Univ Technol, Dept Comp Sci & Engn, Hut 02015, Finland Helsinki Univ Technol Hut Finland 02015 p Sci & Engn, Hut 02015, Finland
Titolo Testata:
JOURNAL OF HEURISTICS
fascicolo: 1, volume: 7, anno: 2001,
pagine: 37 - 46
SICI:
1381-1231(200101)7:1<37:IBFTLC>2.0.ZU;2-Q
Fonte:
ISI
Lingua:
ENG
Keywords:
quasi-twisted codes; tabu search; ternary linear codes;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
15
Recensione:
Indirizzi per estratti:
Indirizzo: Gulliver, TA Univ Victoria, Dept Elect & Comp Engn, STN CSC, POB 3055, Victoria, BC V8W3P6, Canada Univ Victoria POB 3055 Victoria BC Canada V8W 3P6 3P6, Canada
Citazione:
T.A. Gulliver e P.R.J. Ostergard, "Improved bounds for ternary linear codes of dimension 8 using tabu search", J HEURISTIC, 7(1), 2001, pp. 37-46

Abstract

In this paper. new codes of dimension 8 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. Twenty three codes are given which improve or establish the bounds for ternary codes. In addition, a table of upper and lower bounds for d(3) (n, 8) is presented for n less than or equal to 200.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 11/07/20 alle ore 21:11:25