Generalized Schalkwijk-Kailath Coding for Autoregressive Gaussian Channels
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911462252871680 |
|---|---|
| author | Su, Jun Han, Guangyue Shamai, Shlomo |
| author_facet | Su, Jun Han, Guangyue Shamai, Shlomo |
| contents | We propose a Gaussian random coding scheme for AR($p$) Gaussian channels that generalizes the celebrated Schalkwijk-Kailath (SK) coding scheme. This constructive coding scheme, termed the SK(2) coding scheme, yields a closed-form characterization for the corresponding achievable rate. Among many others, this result shows that the celebrated SK coding scheme is not universally optimal, and therefore, disprove the conjecture proposed by Butman in \cite{butman1976linear}. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_09329 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Generalized Schalkwijk-Kailath Coding for Autoregressive Gaussian Channels Su, Jun Han, Guangyue Shamai, Shlomo Information Theory We propose a Gaussian random coding scheme for AR($p$) Gaussian channels that generalizes the celebrated Schalkwijk-Kailath (SK) coding scheme. This constructive coding scheme, termed the SK(2) coding scheme, yields a closed-form characterization for the corresponding achievable rate. Among many others, this result shows that the celebrated SK coding scheme is not universally optimal, and therefore, disprove the conjecture proposed by Butman in \cite{butman1976linear}. |
| title | Generalized Schalkwijk-Kailath Coding for Autoregressive Gaussian Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2601.09329 |