Sciweavers

345 search results - page 12 / 69
» A construction of a space-time code based on number theory
Sort
View
FOCS
2002
IEEE
14 years 18 days ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
IJON
2006
103views more  IJON 2006»
13 years 7 months ago
Evolutionary system for automatically constructing and adapting radial basis function networks
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
Daniel Manrique, Juan Rios, Alfonso Rodrígu...
LPAR
2010
Springer
13 years 6 months ago
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Benjamin Grégoire, Jorge Luis Sacchini
ASIACRYPT
2009
Springer
14 years 2 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
AAECC
2002
Springer
126views Algorithms» more  AAECC 2002»
13 years 7 months ago
Toric Varieties Hirzebruch Surfaces and Error-Correcting Codes
Abstract. For any integral convex polytope in R2 there is an explicit construction of an error-correcting code of length (q - 1)2 over the finite field Fq, obtained by evaluation o...
Johan P. Hansen