We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern a...
W. M. B. Dukes, Toufik Mansour, Astrid Reifegerste