Source and Channel Rate Allocation for Channel Codes Satisfying the Gilbert-varshamov or Tsfasman-vll Adut-zink Bounds Andrr as M Ehes Kenneth Zeger Ieee Transactions on Information Theory
نویسنده
چکیده
We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the Gilbert-Varshamov or Tsfasman-Vll adut-Zink bounds. Formulas giving the high resolution vector quantizer distortion of these systems are also derived. In addition, we give bounds on how far below channel capacity the transmission rate should be for a given delay constraint.
منابع مشابه
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds
We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the Gilbert-Varshamov or Tsfasman-Vlădut-Zink bounds. Formulas giving the high resolution vector quantizer distortion of these systems are also derived. In addition, we give bounds on how far below channel capacity the transmission rate should be for a given delay constraint. The bo...
متن کاملA low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Since the proof in 1982, by Tsfasman Vlăduţ and Zink of the existence of algebraic-geometric (AG) codes with asymptotic performance exceeding the Gilbert–Varshamov (G–V) bound, one of the challenges in coding theory has been to provide explicit constructions for these codes. In a major step forward during 1995–1996, Garcia and Stichtenoth (G–S) provided an explicit description of algebraic curv...
متن کاملTransitive and Self-dual Codes Attaining the Tsfasman-vladut-zink Bound
A major problem in coding theory is the question if the class of cyclic codes is asymptotically good. In this paper we introduce as a generalization of cyclic codes the notion of transitive codes (see Definition 1.4 in Section 1), and we show that the class of transitive codes is asymptotically good. Even more, transitive codes attain the Tsfasman-Vladut-Zink bound over Fq, for all squares q = ...
متن کاملDistance-spectrum formulas on the largest minimum distance of block codes
A general formula for the asymptotic largest minimum distance (in block length) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric, and bounded) is presented. As revealed in the formula, the largest minimum distance can be fully determined by the ultimate statistical characteristics of the normalized distance function evaluated under a properl...
متن کاملThe Art of Signaling: Fifty Years of Coding Theory - Information Theory, IEEE Transactions on
In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitrarily close to channel capacity and probabilities of error arbitrarily close to zero. Fifty years later, codes for the Gaussian channel have been discovered that come close to these fundamental limits. There is now a sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998