On a Kronecker products sum distance bounds

Details On a Kronecker products sum distance bounds On a Kronecker products sum distance bounds

2005-03-17

arxiv.org/abs/cs/0503038v1

Computer Science

Information Theory

4 pages

Scientific paper

A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bounds is allocated.

Affiliated with

Also associated with

No associations

Rating

On a Kronecker products sum distance bounds 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 On a Kronecker products sum distance bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Kronecker products sum distance bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605983