Minimum Distance Border for Random Block Length Binary Code Segment of Linear Recurring Sequence
Keywords:
Linear Recurring Sequence, Hypothetical Мг-Sequence, Binary Code Segment, Minimum Distance Code BorderAbstract
The decision of scientific problem on using linear recurring sequence (LRS) in antinoise coding requires the development the fast ways calculate of maximum correcting ability for the selected for the selected segment of arbitrary LRS segment length. Quantitative correcting ability assessment of such coders is minimum code distance. In this paper unconventional approach to rapid and relatively precise definition of the boundaries of the minimum code distance for random segment length of binary LRS code by applying the hypothetical Mг-sequence is proposed.
References
Published
2014-11-11
How to Cite
Ivantsov, O., & Saitov, I. (2014). Minimum Distance Border for Random Block Length Binary Code Segment of Linear Recurring Sequence. SPIIRAS Proceedings, 4(35), 15-32. https://doi.org/10.15622/sp.35.2
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
