| SHEN SHIYI.[J].数学年刊A辑,1981,2(1):115~120 |
|
| THE FUNDAMENTAL THEOREM OF INFORMATIONTRANSMISSION FOR GENERAL MULTI-USERCOMMUNICATION NETWORK SYSTEMS |
| Received:January 10, 1980 |
| DOI： |
| 中文关键词: |
| 英文关键词: |
| 基金项目: |
|
| Hits: 569 |
| Download times: 0 |
| 中文摘要: |
| |
| 英文摘要: |
| In this paper, we first give a definition of the general multi-user communication network system, and introduce the coding type \[(\mathcal{U},\mathcal{Y},\mathcal{V})\] and \[({\mathcal{U}_0},\mathcal{Y},\mathcal{V})\], for the
general network systems (cf Fig. 1, 2). We obtain the following results:
1. For the above \[(\mathcal{U},\mathcal{Y},\mathcal{V})\] type network system, in the general sequence model, the Shannon theorem of information transmission, the coding theorem of multi-user channel and their converse hold water;
2. The converse coding theorem holds water on the region \[D(\mathcal{L}_{L - J}^{({\text{n}})})\] (see(6.4)) for the general sequence model of \[({\mathcal{U}_0},\mathcal{Y},\mathcal{V})\]type network system;
3. On the memoryless multi-user channel for \[({\mathcal{U}_0},\mathcal{Y},\mathcal{V})\] type network system,
the D(\[\mathcal{L}_{L - J}^{}\]) is an achievable vetes region
For the memoryless multiple-access channel, the \[\mathcal{L}_{L - J}^{}\] is the capacity region,
4. For general \[({\mathcal{U}_0},\mathcal{Y},\mathcal{V})\] type multi-user communication network system, we
set up a new decoding method, whick is said to be information threshold distinguishing decoding. |
| View Full Text View/Add Comment Download reader |
| Close |
|
|
|
|
|
