Results 161 to 170 of about 9,808 (213)
Some of the next articles are maybe not open access.

Reduced GMD decoding

IEEE Transactions on Information Theory, 2003
Summary: A framework is presented for generalized minimum distance (GMD) decoding with a limited number of decoding trials and a restricted set of reliability values. In GMD decoding, symbols received from the channel may be erased before being fed into an algebraic error-erasure decoder for error correction, in subsequent or simultaneous trials with ...
Weber, J.H. (author)   +1 more
openaire   +3 more sources

GMD-Robots

2001
The overall research goal of GMD’s RoboCup team is to increase both, (1) the speed of mobile robots acting as team in a dynamic environment and (2) the speed of design for behavior-based robot control. Therefore, we started in 1998 to develop a proprietary fast robot platform and the integrated Dual Dynamics Design Environment.
Bredenfeld A.   +9 more
openaire   +1 more source

GMDS Algorithm based on OpenStack

Proceedings of the 2018 International Conference on Algorithms, Computing and Artificial Intelligence, 2018
With the rapid development of cloud computing, more and more users choose to deploy applications on virtual machines on the cloud platform. And OpenStack is one of the mainstream cloud platforms in cloud computing. The load imbalance of cloud platform is a concern.
Haixing Li   +2 more
openaire   +1 more source

Decompositions of the GMD

2012
Several basic methods of statistical analysis such as regression and analysis of variance are based on the properties of the decomposition of the measure of variability. In the decomposition of a measure of variability we differentiate between two kinds of decompositions:
Shlomo Yitzhaki, Edna Schechtman
openaire   +1 more source

GMDS: Hardware implementation of novel real output queuing architecture

2008 Design, Automation and Test in Europe, 2008
1455
Arteaga, R.   +4 more
openaire   +2 more sources

Chase-type and GMD coset decodings

IEEE Transactions on Communications, 2000
Summary: Chase decoding algorithms are generalized into a family of bounded distance decoding algorithms, so that the conventional Chase algorithm-2 and Chase algorithm-3 become the two extremes of this family. Consequently, more flexibility in the tradeoffs between error performance and decoding complexity is provided by this generalization ...
Marc P. C. Fossorier, Shu Lin 0001
openaire   +1 more source

Special Topic GMDS 2009

Methods of Information in Medicine, 2010
The 54th annual Conference of the German Society of Medical Informatics, Biometry and Epidemiology (GMDS) took place in Essen, September 7–10 under the headline “Spitzenmedizin und Mensch lichkeit – Krankheit behandeln und Gesundheit fordern” indicating the tension for all three disciplines within modern medicine. The aim of modern medicine is not only
openaire   +2 more sources

Simulation of the Protocols of the GMD-Net

1976
The present results of a performance simulation study of the GMD-Net protocol system (as defined in a preceeding presentation) are outlined.
openaire   +1 more source

On Extended Forney-Kovalev GMD decoding

2009 IEEE International Symposium on Information Theory, 2009
Consider a code C with Hamming distance d. Assume we have a decoder Φ that corrects e errors and θ erasures if λe + θ ≤ d − 1, where a real number 1 ≪ λ ≤ 2 is the tradeoff rate between errors and erasures for this decoder. This holds e.g. for l-punctured Reed-Solomon codes, i.e., codes over the field F q l of length n ≪ q with locators taken from the
Vladimir Sidorenko   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy