Cart (Loading....) | Create Account
Close category search window
 

Singularity Probability Analysis for Sparse Random Linear Network Coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaolin Li ; Hong Kong Univ. of Sci. & Technol., Kowloon, China ; Wai Ho Mow ; Fai-Lung Tsang

Motivated by the noncoherent subspace coding approach and the low-complexity sparse coding approach to realize random linear network coding, we consider the problem of characterizing the probability of having a full rank (or nonsingular) square transfer matrix over a finite field, for which the probability of choosing the zero element is different from that of choosing a nonzero element. We found that for a sufficiently large field size, whether the transfer matrix is singular or not is determined with probability one by the zero pattern of the matrix, i.e., where the zeroes are located in the matrix. This result provides insight for optimizing sparse random linear network coding schemes and allows the problem of determining the probability of having a nonsingular transfer matrix over a large field size to be transformed into a combinatorial problem. By using some combinatorial arguments, useful upper and lower bounds on the singularity probability of the random transfer matrix are derived.

Published in:

Communications (ICC), 2011 IEEE International Conference on

Date of Conference:

5-9 June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.