the proceedings contain 23 papers. the topics discussed include: joint LDPC codes for multi-user relay channel;networkcoding meets MIMO;robust networkcoding using diversity through backup flows;network spread coding...
详细信息
ISBN:
(纸本)9781424416899
the proceedings contain 23 papers. the topics discussed include: joint LDPC codes for multi-user relay channel;networkcoding meets MIMO;robust networkcoding using diversity through backup flows;network spread coding;optimal layered multicast using networkcoding;butterflies in the mesh: lightweight localized wireless networkcoding;a joint network-channel coding technique for single-Hop wireless networks;opportunistic cooperative network-coding based on space-time coding for bi-directional traffic flows;dualities between entropy functions and network codes;ring-theoretic foundation of convolutional networkcoding;on locating Byzantine attackers;basic entropy sets;some recent progresses in network error correction codingtheory;and a concatenated networkcoding scheme for multimedia transmission.
Encoding is an important research direction of information security. the codingtheory has a lot of important applications in cryptogram, communication technology and network security, etc. coding over a ring is one o...
详细信息
ISBN:
(纸本)9798400712623
Encoding is an important research direction of information security. the codingtheory has a lot of important applications in cryptogram, communication technology and network security, etc. coding over a ring is one of important research objects in codingtheory. In this article, we mainly study the problem for the generators for a special code called skew quasi-cyclic code over the ring \({Z}_2{Z}_4[u]\), where\({u}^2 = 0\).
A condition governing the possibility and impossibility of linear independence among the global encoding kernels of a linear network code is found. Based on this condition, we propose several alternative definitions o...
详细信息
A condition governing the possibility and impossibility of linear independence among the global encoding kernels of a linear network code is found. Based on this condition, we propose several alternative definitions of generic network codes, which give interpretations of such codes from different perspectives. We also present a unified framework for specifying and constructing different classes of linear network codes. Finally, using the insight obtained from the unified framework, we show that the proofs of some existing results regarding generic network codes can be greatly simplified.
In this paper, we investigate a hybrid networkcoding technique to be used at a wireless base station (BS) or access point (AP) to increase the throughput efficiency of single-hop wireless networks. Traditionally, to ...
详细信息
In this paper, we investigate a hybrid networkcoding technique to be used at a wireless base station (BS) or access point (AP) to increase the throughput efficiency of single-hop wireless networks. Traditionally, to provide reliability, lost packets from different flows (applications) are retransmitted separately, leading to inefficient use of wireless bandwidth. Using the proposed hybrid networkcoding approach, the BS encodes these lost packets, possibly from different flows together before broadcasting them to all wireless users. In this way, multiple wireless receivers can recover their lost packets simultaneously with a single transmission from the BS. Furthermore, simulations and theoretical analysis showed that when used in conjunction with an appropriate channel coding technique under typical channel conditions, this approach can increase the throughput efficiency up to 3.5 times over the Automatic Repeat reQuest (ARQ), and up to 1.5 times over the HARQ techniques.
In communications networks, the capacity region of multisource networkcoding is given in terms of the set of entropy functions Gamma*. More broadly, determination of Gamma* would have an impact on converse theorems f...
详细信息
In communications networks, the capacity region of multisource networkcoding is given in terms of the set of entropy functions Gamma*. More broadly, determination of Gamma* would have an impact on converse theorems for multi-terminal problems in information theory. this paper provides several new dualities between entropy functions and network codes. Given a function g >= 0 defined on all subsets of N random variables, we provide a construction for a network multicast problem which is "solvable" if and only if g is the entropy function of a set of quasi-uniform random variables. the underlying network topology is fixed and the multicast problem depends on g only through link capacities and source rates. A corresponding duality is developed for linear network codes, where the constructed multicast problem is linearly solvable if and only if g is linear group characterizable. Relaxing the requirement that the domain of g be subsets of random variables, we obtain a similar duality between polymatroids and the linear programming bound. these duality results provide an alternative proof of the insufficiency of linear (and abelian) network codes, and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on networkcoding capacity regions.
We examine networks that employ networkcoding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzant...
详细信息
ISBN:
(纸本)9781424416899
We examine networks that employ networkcoding and are subject to Byzantine attacks. We assume that an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setup, we formulate the problem of locating these malicious nodes that insert errors. We utilize the subspace properties of (randomized) networkcoding to develop algorithms to locate the Byzantine attackers.
Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate ...
详细信息
ISBN:
(纸本)9781424416899
Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. We investigate offline and online algorithms that optimize delay, boththrough theoretical analysis as well as simulation results.
Rainbow network flow is a recent enquiry into rate-distortion optimized network flow of a multiple description (MD) coded source from multiple encoders to multiple sinks. this paper is a first attempt to combine netwo...
详细信息
ISBN:
(纸本)9781424416899
Rainbow network flow is a recent enquiry into rate-distortion optimized network flow of a multiple description (MD) coded source from multiple encoders to multiple sinks. this paper is a first attempt to combine networkcoding with rainbow network flow, and formulates a new problem called rainbow networkcoding (RNC). It is shown that performing linear networkcoding at intermediate nodes of a flow path can achieve higher networkthroughput than the original rainbow network flow solution. RNC is related to the linear broadcast problem defined in networkcodingtheory, but it has a different objective function that is more meaningful for lossy signal compression applicationsthan linear broadcast. We prove the RNC problem to be NP-hard, and propose some heuristic solutions. Examples are presented to study the differences between rainbow networkcoding, rainbow network flow, and linear broadcast.
Very recently, an operator channel was defined by Koetter and Kschischang when they studied random networkcoding. they also introduced constant dimension codes and demonstrated that these codes can be employed to cor...
详细信息
ISBN:
(纸本)9781424416899
Very recently, an operator channel was defined by Koetter and Kschischang when they studied random networkcoding. they also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. In this paper, a Graham-Sloane type construction of constant dimension codes is presented. It is shown that the construction for the case of minimum dimension distance 4 exceeds the Gilbert type lower bound for constant dimension codes.
暂无评论