Concatenated kernel codes
R. Selvakumar, C. Pavan Kumar
Source record
Source: Crossref
Published: Jun 1, 2020
DOI: 10.1142/s1793830920500445
Open original source ↗Source abstract
Concatenated codes introduced by Forney in 1966 received wide attention due to their extensive usage in space missions. Thereafter, many concatenated codes were constructed on the similar lines and successfully employed in digital communication setup. In this paper, concatenated kernel code is defined. An example of concatenated kernel code and its trellis is constructed to demonstrate the importance of defined code and its computation. For the constructed code, the presence of homomorphism is tested using Blum–Luby–Rubinfeld Linearity test. Further, for the constructed trellis of the example code the properties such as proper, co-proper, biproper, one-to-one, minimal and minimal proper are investigated.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.