Blind Recognition of Cyclic Codes Based on Average Cosine Conformity

2020 ◽  
Vol 68 ◽  
pp. 2328-2339
Author(s):  
Zhaojun Wu ◽  
Zhaogen Zhong ◽  
Limin Zhang
Keyword(s):  
Cyclic Codes ◽  
Blind Recognition ◽  
Average Cosine

Blind Recognition for Rate below 1/2 Binary Cyclic Codes

2014 ◽  
Vol 511-512 ◽  
pp. 1163-1166
Author(s):  
Hong Wei Wang ◽  
Lin Yang ◽  
Yi Bing Cai
Keyword(s):  
Channel Coding ◽  
Cyclic Codes ◽  
Code Word ◽  
Blind Recognition

The blind recognition of channel coding is playing more and more important roles in smart communications. The paper took rate below 1/2 binary cyclic codes to research, we established a model using counter of continuous bits 0. At the basic of studying the features of binary cyclic codes, when the condition about the rate is satisfied, we made a statistics of the continuous bits 0 in a long sequence of code words to get the length of code word n and the length of information k. In the condition of higher BER simulations, we improved the method to make it suitable for estimating the parameter.

scholarly journals Blind recognition of binary cyclic codes

2013 ◽  
Vol 2013 (1) ◽  
Author(s):  
Zhou Jing ◽  
Huang Zhiping ◽  
Su Shaojing ◽  
Yang Shaowu
Keyword(s):  
Cyclic Codes ◽  
Blind Recognition

An Improved Algorithm of RS Codes Blind Recognition

2014 ◽  
Vol 602-605 ◽  
pp. 2308-2312
Author(s):  
Tong Li ◽  
Cheng Lin Miao ◽  
Jun Lv
Keyword(s):  
Channel Coding ◽  
Information Acquisition ◽  
Communication Systems ◽  
Cyclic Codes ◽  
Block Codes ◽  
Error Rates ◽  
Coding Sequences ◽  
Linear Block Codes ◽  
Rs Codes ◽  
Blind Recognition

The acquisition of information about channel coding sequences is the research emphasis and difficulties at present, and recognizing the channel coding parameters is the prerequisite for information acquisition. RS Codes are a class of linear block codes as well as a special class of BCH Codes and cyclic codes. It regards a group of symbols with a length of n as a unit to process with, and the n symbols are generated by k transmitting information symbols under some proper associated rules. RS Codes are widely used in various communication systems. In this paper, an algorithm of RS Codes blind recognition is researched. And a blind recognition model is established on MATLAB. At last, the paper presents the recognition rates of situations with different error rates.

A Large Class of p-Ary Cyclic Codes and Sequence Families

2010 ◽  
Vol E93-A (11) ◽  
pp. 2272-2277
Author(s):  
Zhengchun ZHOU ◽  
Xiaohu TANG ◽  
Udaya PARAMPALLI
Keyword(s):  
Large Class ◽  
Cyclic Codes

A Family of q-Ary Cyclic Codes with Optimal Parameters

2020 ◽  
Vol E103.A (3) ◽  
pp. 631-633
Author(s):  
Wenhua ZHANG ◽  
Shidong ZHANG ◽  
Yong WANG ◽  
Jianpeng WANG
Keyword(s):  
Cyclic Codes ◽  
Optimal Parameters

A class of constacyclic codes over the ring Z4[u,v]/ and their Gray images

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash
Keyword(s):  
Cyclic Codes ◽  
Constacyclic Codes ◽  
Gray Maps ◽  
Permutation Equivalent ◽  
Quasi Cyclic Codes

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.

scholarly journals Monomial codes seen as invariant subspaces

2017 ◽  
Vol 15 (1) ◽  
pp. 1099-1107 ◽  
Author(s):  
María Isabel García-Planas ◽  
Maria Dolors Magret ◽  
Laurence Emilie Um
Keyword(s):  
Finite Field ◽  
Linear Algebra ◽  
Linear Transformation ◽  
Cyclic Codes ◽  
Invariant Subspaces ◽  
Hyperinvariant Subspaces ◽  
Computationally Expensive ◽  
The Relationship

Abstract It is well known that cyclic codes are very useful because of their applications, since they are not computationally expensive and encoding can be easily implemented. The relationship between cyclic codes and invariant subspaces is also well known. In this paper a generalization of this relationship is presented between monomial codes over a finite field 𝔽 and hyperinvariant subspaces of 𝔽n under an appropriate linear transformation. Using techniques of Linear Algebra it is possible to deduce certain properties for this particular type of codes, generalizing known results on cyclic codes.

Sign in / Sign up

Export Citation Format

Share Document