Design of Degree Distribution with Maximum Distance Separable Codes for User Priority

Abstract

—In the super-dense future network communication, human and machine communications are mixed in a single network. They will trespass each other and could lead to an intersection. This paper develops Coded Random Access (CRA) using Maximum Distance Sparable (MDS) codes as a multiple access scheme to serve millions of users, covering human and machines. This research aims to maximum number of user human and machines, where the priority access is given to the human. Two keywords of CRA, i.e., coding (solved by optimal degree distributions) and random. To analyze design degree distribution using Extrinsic Information Transfer (EXIT) Chart projection under binary erasure channels (BEC). The priority scheme for human communications is determined based on utility functions. The parameters used to see the performance of the EXIT chart are packet-loss-rate (PLR) and throughput. Based on the results, the degree design has succeeded in prioritizing humans, which is indicated by the small PLR value but large throughput, as well as the EXIT curve with its very small gap.