pith. sign in

arxiv: 1302.4146 · v1 · pith:K6AKHCY3new · submitted 2013-02-18 · 💻 cs.IT · math.IT

Linear Network Error Correction Multicast/Broadcast/Dispersion Codes

classification 💻 cs.IT math.IT
keywords codesnetworklinearbroadcastcorrectiondispersionerrormulticast
0
0 comments X
read the original abstract

In this paper, for the purposes of information transmission and network error correction simultaneously, three classes of important linear network codes in network coding, linear multicast/broadcast/dispersion codes are generalized to linear network error correction coding, i.e., linear network error correction multicast/broadcast/dispersion codes. We further propose the (weakly, strongly) extended Singleton bounds for these new classes of codes, and define the optimal codes satisfying the corresponding Singleton bounds with equality, which are called multicast/broadcast/dispersion MDS codes respectively. The existence of such codes are proved by an algebraic method and one kind of constructive algorithm is also proposed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.