Computer Science – Information Theory
Scientific paper
2007-09-07
Computer Science
Information Theory
12 pages, submitted to Designs, Codes and Cryptography
Scientific paper
Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a family of optimal constant dimension codes achieving both the Johnson type bounds I and II.
Fu Fang-Wei
Xia Shu-Tao
No associations
LandOfFree
Johnson Type Bounds on Constant Dimension Codes 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 Johnson Type Bounds on Constant Dimension Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Johnson Type Bounds on Constant Dimension Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-467426