constrained codes
Recently Published Documents


TOTAL DOCUMENTS

90
(FIVE YEARS 9)

H-INDEX

12
(FIVE YEARS 0)

2021 ◽  
Author(s):  
Tuan Thanh Nguyen ◽  
Kui Cai ◽  
Kees A. Schouhamer Immink ◽  
Yeow Meng Chee


2021 ◽  
Vol 7 (1) ◽  
pp. 1-8
Author(s):  
Ari Dwi Hartanto ◽  
Al. Sutjijana

The phenomena of unknown gain or offset on communication systems and modern storages such as optical data storage and non-volatile memory (flash) becomes a serious problem. This problem can be handled by Pearson distance applied to the detector because it offers immunity to gain and offset mismatch. This distance can only be used for a specific set of codewords, called Pearson codes. An interesting example of Pearson code can be found in T-constrained code class. In this paper, we present binary 2-constrained codes with cyclic property. The construction of this code is adopted from cyclic codes, but it cannot be considered as cyclic codes.



2021 ◽  
Vol 67 (1) ◽  
pp. 282-295
Author(s):  
Ahmed Hareedy ◽  
Beyza Dabak ◽  
Robert Calderbank


Author(s):  
Jessica Centers ◽  
Xinyu Tan ◽  
Ahmed Hareedy ◽  
Robert Calderbank




Author(s):  
Tuan Thanh Nguyen ◽  
Kui Cai ◽  
Kees A. Schouhamer Immink ◽  
Han Mao Kiah


AIP Advances ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 015009
Author(s):  
S. Sokjabok ◽  
M. Mattayakan ◽  
C. Buajong ◽  
S. Koonkarnkhai ◽  
P. Kovintavewat ◽  
...  




2021 ◽  
Vol 67 (1) ◽  
pp. 187-199
Author(s):  
Han Mao Kiah ◽  
Anshoo Tandon ◽  
Mehul Motani


2020 ◽  
Vol 56 (11) ◽  
pp. 1-10
Author(s):  
Beyza Dabak ◽  
Ahmed Hareedy ◽  
Robert Calderbank


Sign in / Sign up

Export Citation Format

Share Document