Shan Lu

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

BNNs- and TISTA- Based Signature Code Design for User Identification and Channel Estimation over Multiple-Access Channel with Rayleigh Fading.

[BibT_eX]

[DOI]

Lantian Wei

Proceedings of the IEEE Information Theory Workshop, 2023

2022

User Identification and Channel Estimation by Iterative DNN-Based Decoder on Multiple-Access Fading Channel.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Improved Survival Probability for Coded Compressed Sensing in Unsourced Random Access.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2022

Balanced coding with Lehmer code.

[BibT_eX]

[DOI]

Takumi Marumo

Proceedings of the International Symposium on Information Theory and Its Applications, 2022

Accuracy Evaluation of Indoor Positioning by Received Signal Strength using Deep Learning.

[BibT_eX]

[DOI]

Yuma Narita

Proceedings of the 24th International Conference on Advanced Communication Technology, 2022

2020

Design of ZDF code using uniform shift enumerator.

[BibT_eX]

[DOI]

Yuya Naruse

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

User Identification and Channel Estimation by DNN-Based Decoder on Multiple-Access Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2020

2019

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.

[BibT_eX]

[DOI]

CoRR, 2019

A construction of UD k-ary multi-user codes from (2<sup>m</sup>(k-1)+1)-ary codes for MAAC.

[BibT_eX]

[DOI]

CoRR, 2019

Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Burst Erasure Correction by 2D LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018

Construction of Parallel Random I/O Codes Using Coset Coding with Hamming Codes.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Unrestricted-Rate Parallel Random Input-Output Codes for Multilevel Flash Memory.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

A New Kind of Nonbinary Uniquely Decodable Codes with Arbitrary Code Length for Multiple-Access Adder Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

An Upper Bound on the Generalized Cayley Distance.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Improving Polar Codes by Spatial Coupling.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Error Floor Estimation of Spatially-Coupled Irregular LDPC Code Ensembles.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Recursive Construction of k-Ary Uniquely Decodable Codes for Multiple-Access Adder Channel.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017

Worst-Case Performance of ILIFC with Inversion Cells.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Lower Bounds on the Number of Writing Operations by ILIFC with Inversion Cells.

[BibT_eX]

[DOI]

CoRR, 2017

Construction of parallel RIO codes using coset coding with hamming codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Codes for T-user asymmetric multiple-access channel with independent sources.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Lower bounds on the number of write operations by index-less indexed flash code with inversion cells.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Construction of unrestricted-rate parallel random input-output code.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Rate-compatible spatially coupled LDPC code ensembles based on repeat-accumulate extensions.

[BibT_eX]

[DOI]

IET Commun., 2016

Spatially Coupled Repeater-Combiner-Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2016

Input-output weight distribution of terminated RSC codes with limited codelength.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015

A Family of (k+1)-Ary Signature Codes for Noisy Multiple-Access Adder Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

2014

Rate-compatible spatially coupled LDPC codes via repeat-accumulation extension.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Coding scheme for T-user noisy multiple-access adder channel.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013

Recursive Construction of (<i>k</i>+1)-Ary Error-Correcting Signature Code for Multiple-Access Adder Channel.

[BibT_eX]

[DOI]

Yoichiro Watanabe

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Two-User Turbo Decoding with Simplified Sum Trellis in Two-Way Relay Channel.

[BibT_eX]

[DOI]

IEICE Trans. Commun., 2013

Generalized construction of signature code for multiple-access adder channel.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Decoding for non-binary signature code.

[BibT_eX]

[DOI]

Yoichiro Watanabe

Proceedings of the International Symposium on Information Theory and its Applications, 2012

2010

Low-complexity turbo decoding scheme for two-way relay network.

[BibT_eX]

[DOI]

Ying Li