Formation of the Linear Network Code Generating Matrix for Minimizing Its Redundancy

Methods for forming the generator matrix of a linear network code are considered to determine a method that allows it to be formed without singular submatrices in the Galois field and ensures minimal redundancy to eliminate lost data (packets). Simulation results are presented confirming the feasibility of using matrices based on Singleton configurations as generator matrices for a linear network code, minimizing its redundancy and ensuring the absence of singular submatrices in the Galois field.