2000
DOI: 10.1109/18.868483
|View full text |Cite
|
Sign up to set email alerts
|

Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds

Abstract: We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the Gilbert-Varshamov or Tsfasman-Vlȃduţ-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 bounds obtained depend on the relationship between channel code rate and relative minimum distance guaranteed by the Gil… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
11
0

Year Published

2000
2000
2000
2000

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(11 citation statements)
references
References 19 publications
0
11
0
Order By: Relevance
“…However, those results assume the existence of optimal channel codes, namely, those described in Shannon's channel coding theorem using random coding arguments. Similar techniques were used to generalize the results of [5] to Gaussian channels [6] and to certain algebraic-geometry codes [7]. Hence, the results in [5]- [7] are existence constructions and do not necessarily correspond to achievable performance based on the best presently known implementable channel codes.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…However, those results assume the existence of optimal channel codes, namely, those described in Shannon's channel coding theorem using random coding arguments. Similar techniques were used to generalize the results of [5] to Gaussian channels [6] and to certain algebraic-geometry codes [7]. Hence, the results in [5]- [7] are existence constructions and do not necessarily correspond to achievable performance based on the best presently known implementable channel codes.…”
Section: Introductionmentioning
confidence: 99%
“…Similar techniques were used to generalize the results of [5] to Gaussian channels [6] and to certain algebraic-geometry codes [7]. Hence, the results in [5]- [7] are existence constructions and do not necessarily correspond to achievable performance based on the best presently known implementable channel codes. There is thus motivation to find a high resolution theory for quantization with a noisy channel, using families of structured algebraic channel codes.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations