Justesen code

In coding theory, Justesen codes form a class of error-correcting codes that have a constant rate, constant relative distance, and a constant…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

Given a specified rate target R, the construction involved a brute force search for the inner code Cin of rate r that met the…

2006

For a decision problem from coding theory, we prove a quadratic expected time-space tradeoff of the form $\eT\eS=\Omega(\tfrac{n…

2006

Up until now, we have seen bounds that tell us good codes should be possible but we didn’t know how to construct such codes…

2003

In this paper, we give the weight distributions of Justesen codes obtained by using some other RS codes as the outer code…

1997

In this note we show that a bound on the minimum distance of Justesen codes can be improved significantly in some cases.

1978

A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesen code. The lower…

1978

Abstract : In this report, constructions are given for two new block codes. The first construction produces a class of…

Review

1977

Review

1977

recent progress in the field, it is also suitable as a supplement to student with a strong background in mathematics who wants to…

1974

It is shown that the fraction p of ones in the Mn positions of M distinct binary n-tuples satisfies a given inequality. This…

1974