Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...