Soft Decision Decoding of Binary Linear Block Codes Using the Bfgs-Method
Page 1
Klaus Ritter, Stefan Schaffler, Thomas F. Sturm (1998)
The Yugoslav Journal of Operations Research
Tamm, Ulrich (2001)
The Electronic Journal of Combinatorics [electronic only]
Štefan Šujan (1985)
Kybernetika
Zdzisław Skupień (1995)
Discussiones Mathematicae Graph Theory
Shannon-Vizing-type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree Δ(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d-index and chromatic d-number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their growth is found.
Bouyuklieva, Stefka (2007)
Serdica Journal of Computing
* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.MDS [8,4,5] codes over a field with 64 elements are constructed. All such codes which are self-dual under a Hermitian type inner product are classified. The connection between these codes and a putative binary self- dual [72,36,16] code is considered.
Habsieger, Laurent (1996)
The Electronic Journal of Combinatorics [electronic only]
Varbanov, Zlatko (2007)
Serdica Journal of Computing
* Supported by COMBSTRU Research Training Network HPRN-CT-2002-00278 and the Bulgarian National Science Foundation under Grant MM-1304/03.Additive code C over GF(4) of length n is an additive subgroup of GF(4)n. It is well known [4] that the problem of finding stabilizer quantum error-correcting codes is transformed into problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to construct good additive self-dual codes of length 13...
Silviu Guiaşu, Corina Reischer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Quistorff, Jörn (2003)
The Electronic Journal of Combinatorics [electronic only]
Igor Vajda (1995)
Kybernetika
Charon, Iréne, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2007)
The Electronic Journal of Combinatorics [electronic only]
Antoine Lobstein, Gérard Cohen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Jean-Claude Bermond, A. Bonnecaze, T. Kodate, Stéphane Pérennes, Patrick Solé (1999)
Annales de l'institut Fourier
In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an -dimensional hypercube in the circuit switched, -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...
Page 1