Soft Decision Decoding of Binary Linear Block Codes Using the Bfgs-Method
Page 1
Displaying 1 – 13 of 13
Some aspects of Hankel matrices in coding theory and combinatorics.
Tamm, Ulrich (2001)
The Electronic Journal of Combinatorics [electronic only]
Some functionals on sets of stationary codes
Štefan Šujan (1985)
Kybernetika
Some maximum multigraphs and edge/vertex distance colourings
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.
Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code
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.
Some new lower bounds for ternary covering codes.
Habsieger, Laurent (1996)
The Electronic Journal of Combinatorics [electronic only]
Some new Results for Additive Self-Dual Codes over GF(4)
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...
Some remarks on entropic distance, entropic measure of connexion and Hamming distance
Silviu Guiaşu, Corina Reischer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Some remarks on the Plotkin bound.
Quistorff, Jörn (2003)
The Electronic Journal of Combinatorics [electronic only]
Statistical tests of optimality of source codes
Igor Vajda (1995)
Kybernetika
Structural properties of twin-free graphs.
Charon, Iréne, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2007)
The Electronic Journal of Combinatorics [electronic only]
Sur la complexité d'un problème de codage
Antoine Lobstein, Gérard Cohen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Symmetric flows and broadcasting in hypercubes
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...
Currently displaying 1 – 13 of 13
Page 1