We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
In this paper the objective is to enhance the spectral efficiency using combinations of transmit antenna selection with Linear Dispersion Code Selection. Both bit error rate minimi...