On the list decodability of self-orthogonal rank-metric codes

Liu, Shu

doi:10.1016/j.ffa.2018.08.007

Cited by 4 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Analytical model for write margin is simulated using Monte Carlo simulation to prove the better performance of SRAM. Linear rank metric code and linear self‐orthogonal codes are decoded to the Gilbert‐Varshamov bound with polynomial list size and exponential list size as the radius . They are used in cryptography and network coding applications.…”

Section: Introductionmentioning

confidence: 99%

“…Linear rank metric code and linear self-orthogonal codes are decoded to the Gilbert-Varshamov bound with polynomial list size and exponential list size as the radius. 7 They are used in cryptography and network coding applications. Algorithms, methods, and models for optimization of control units and silicon area are carried out in De Micheli.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Power efficient low latency architecture for decoder: Breaking the ACS bottleneck

Radha

Shylu

Nagabushanam

2019

Circuit Theory & Apps

View full text Add to dashboard Cite

Summary Viterbi decoder (VD) is the majority used decoder for convolutional codes which play a role in WLAN and WSN applications. The trellis in VD needs proper analysis to calculate the metric at each stage to obtain a shortest path from every state to the next state. Existing techniques in VD design are namely (a) pipelined architecture, (b) modular ACS and buffers technique, and (c) quasi cyclic trellis technique. The key challenge of the VD trellis circuit is to attain high throughput and better latency performance with low power consumption without affecting hardware complexity of VD. This paper presents several of conventional methods used in VD. We also proposed a new method for VD with K the constraint length as multiple of M, the radix in trellis to calculate the shortest survival path to travel in trellis. The proposed VD is simulated using Xilinx. Use of a trace back approach in the proposed Viterbi decoder with capacitive and resistive feedback yields better throughput, latency, and power consumption with respect to other techniques. The static power outputs obtained in RE, shift update, and selective update methods using Libero IDE are also compared.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Power efficient low latency architecture for decoder: Breaking the ACS bottleneck

Radha

Shylu

Nagabushanam

2019

Circuit Theory & Apps

View full text Add to dashboard Cite

show abstract

“…In Chapter 4, we show that the performance of random F q -linear self-orthogonal rank-metric codes is as good as that of general random F q -linear rank-metric codes. Specifically, the list decoding radius can attain the Gilbert-Varshamov bound in [37].…”

Section: Figure 14: Decoding Radius Of Rank-metric Codes [8]mentioning

confidence: 99%

“…This chapter is based on the work in [37]. In [20], V. Guruswami and N. Resch proved that a random F q -linear rank-metric code is list decodable with list decoding radius attaining the Gilbert-Varshamov bound.…”

Section: Self-orthogonal Rank-metric Codesmentioning

confidence: 99%

List decoding of rank-metric and cover-metric codes

Liu¹

Self Cite

View full text Add to dashboard Cite

pore. Many great people helped and contributed to my research, it has been a great and unforgettable time. Hence, I want to express my deepest and sincerest gratitude to them. Words might not be enough.First of all, my deepest gratitude is extended to my supervisors Prof. Chaoping Xing and Prof. Huaxiong Wang. I would like to thank Prof. Chaoping Xing for bringing me into coding theory, for enthusiastically encouraging me to research, for helping me to open my view, for guiding me to play badminton and for supporting me in uncountable aspects during the past four years. I would also like to thank Prof. Huaxiong Wang from whom I got invaluable guidance and support in so many aspects during my Ph.D. time. I also appreciate their patience and belief in me. I believe it is my great honor to work with them.I would like to thank my caring and loving family for their faithful support. In my life, my family always supports and encourages me. I am forever indebted to my parents for their concern and love. I dedicate this thesis to them.The last four years were an unforgettable and enjoyable time for me in Singapore. I am especially grateful to my labmates in SPMS-MAS-0421 and all friends for helping and supporting me. i List of WorksBelow is my list of works done during my Ph.D. studies in Nanyang Technological University.

show abstract