Sciweavers

JC
2000
89views more  JC 2000»
13 years 10 months ago
Weakly Computable Real Numbers
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
ICC
2007
IEEE
14 years 5 months ago
Some Results on the Binary Minimum Distance of Reed-Solomon Codes and Block Turbo Codes
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
Raphaël Le Bidan, Ramesh Pyndiah, Patrick Add...