Theorems are presented concerning the optimality of rational approximations using non-Archimedean norms. The algorithm for developing the rational approximations is based on continued fraction techniques and is virtually equivalent to an algorithm employed by Berlekamp for decoding BCH codes. Several variations of the continued fraction technique and Berlekamp's algorithm are illustrated on a common example.
No takes yet. Share an insight, caveat, or question.
Welch et al. (1979) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: