Bounds on constant weight codes correcting localized errors

We derive upper and lower bounds for constant weight codes on a channel with localized errors. Coding for channels with localized errors is a new branch of coding theory. From a practical point of view it is important to find good, easily decodable codes. From an information theory point of view it is important to investigate how good these codes can be, that is finding the theoretical limits. For conventional error correcting codes a great deal of interest has been directed towards constant weight codes. They have properties which make them interesting in various situations. This fact has motivated us to look at constant weight codes for localized errors.<
>