Computer Science – Information Theory
Scientific paper
2010-03-25
Computer Science
Information Theory
submitted for ALCOMA10
Scientific paper
Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of $\F_q^n$ with a given dimension. A computer search for large constant dimension codes is usually inefficient since the search space domain is extremely large. Even so, we found that some constant dimension lexicodes are larger than other known codes. We show how to make the computer search more efficient. In this context we present a formula for the computation of the distance between two subspaces, not necessarily of the same dimension.
Etzion Tuvi
Silberstein Natalia
No associations
LandOfFree
Large Constant Dimension Codes and Lexicodes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Large Constant Dimension Codes and Lexicodes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large Constant Dimension Codes and Lexicodes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-556426