Difference Equations and SBEC Optimal Codes

This paper studies the patterns of the solutions of an equation on bounds for one kind of optimal codes that corrects all solid bursts of length b or less and no others. Difference equations that are satisfied by the solutions (namely the parameters-the code length and information digits of such codes) are obtained.