On Minimum Distances for Error Correction and Detection of Generalized Network Code
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915905272807424 |
|---|---|
| author | Chen, Yulin Yeung, Raymond W. |
| author_facet | Chen, Yulin Yeung, Raymond W. |
| contents | It is well known that the minimum distance for linear network codes plays the same role as the minimum distance for classical error control codes. However, Yang and Yeung (2008) discovered that for nonlinear network codes, the minimum distance for error correction is not always the same as the minimum distance for error detection. Inspired by the idea that the channel will affect the distances between the codewords, we establish the scheme of a generalized network channel and a generalized network code. Then, we systematically define the distances for error correction and error detection under the scheme of the generalized network code. We consider the joint error correction and detection in the generalized network code and obtain a complete characterization by introducing a distance and its refined version for this purpose. We enhance our understanding of the relation between various distances for error correction and detection in generalized network codes by proving some bounds on these distances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_00647 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Minimum Distances for Error Correction and Detection of Generalized Network Code Chen, Yulin Yeung, Raymond W. Information Theory It is well known that the minimum distance for linear network codes plays the same role as the minimum distance for classical error control codes. However, Yang and Yeung (2008) discovered that for nonlinear network codes, the minimum distance for error correction is not always the same as the minimum distance for error detection. Inspired by the idea that the channel will affect the distances between the codewords, we establish the scheme of a generalized network channel and a generalized network code. Then, we systematically define the distances for error correction and error detection under the scheme of the generalized network code. We consider the joint error correction and detection in the generalized network code and obtain a complete characterization by introducing a distance and its refined version for this purpose. We enhance our understanding of the relation between various distances for error correction and detection in generalized network codes by proving some bounds on these distances. |
| title | On Minimum Distances for Error Correction and Detection of Generalized Network Code |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.00647 |