Tadashi Wadayama

Orcid: 0000-0003-4391-4294

According to our database1, Tadashi Wadayama authored at least 113 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Proximal Decoding for LDPC Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

Stochastic Dynamics of Noisy Average Consensus: Analysis and Optimization.
CoRR, 2023

Ordinary Differential Equation-based Sparse Signal Recovery.
CoRR, 2023

Deterministic Fault-Tolerant Connectivity Labeling Scheme.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Gradient Flow Decoding for LDPC Codes.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Deep Unfolding-based Distributed MIMO Detection.
Proceedings of the Asia Pacific Signal and Information Processing Association Annual Summit and Conference, 2023

2022
Convergence Acceleration via Chebyshev Step: Plausible Interpretation of Deep-Unfolded Gradient Descent.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., August, 2022

Deep Unfolding-based Weighted Averaging for Federated Learning under Heterogeneous Environments.
CoRR, 2022

Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time.
CoRR, 2022

Asymptotic Mean Squared Error of Noisy Periodical Successive Over-Relaxation.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Continuous-Time Noisy Average Consensus System as Gaussian Multiple Access Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Fully Analog Noise-Resilient Dynamical Systems Storing Binary Sequence.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Precoder Design for Correlated Data Aggregation via Over-the-Air Computation in Sensor Networks.
Proceedings of the IEEE Globecom 2022 Workshops, 2022

MMSE Signal Detection for MIMO Systems based on Ordinary Differential Equation.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Chebyshev Periodical Successive Over-Relaxation for Accelerating Fixed-Point Iterations.
IEEE Signal Process. Lett., 2021

Secure Computation-and-Forward With Linear Codes.
IEEE J. Sel. Areas Inf. Theory, 2021

Deep-Unfolded Sparse CDMA: Multiuser Detector and Sparse Signature Design.
IEEE Access, 2021

Proximal Decoding for LDPC-coded Massive MIMO Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

MSE-Optimaized Linear Transform for Noisy Fronthaul Channels in Distributed MIMO C-RAN.
Proceedings of the IEEE Global Communications Conference, 2021

Refined Density Evolution Analysis of LDPC Codes for Successive Interference Cancellation.
Proceedings of the IEEE Global Communications Conference, 2021

2020
Asymptotic Behavior of Spatial Coupling LDPC Coding for Compute-and-Forward Two-Way Relaying.
IEEE Trans. Commun., 2020

Acceleration of Cooperative Least Mean Square via Chebyshev Periodical Successive Over-Relaxation.
CoRR, 2020

Chebyshev Inertial Landweber Algorithm for Linear Inverse Problems.
CoRR, 2020

Theoretical Interpretation of Learned Step Size in Deep-Unfolded Gradient Descent.
CoRR, 2020

Chebyshev Inertial Iteration for Accelerating Fixed-Point Iterations.
CoRR, 2020

Deep Learning-Based Average Consensus.
IEEE Access, 2020

Trainable Projected Gradient Detector for Sparsely Spread Code Division Multiple Access.
Proceedings of the 2020 IEEE International Conference on Communications Workshops, 2020

Complex Trainable Ista for Linear and Nonlinear Inverse Problems.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Deep Unfolded Multicast Beamforming.
Proceedings of the IEEE Global Communications Conference, 2020

2019
Approximation Theory for Connectivity of Ad Hoc Wireless Networks With Node Faults.
IEEE Wirel. Commun. Lett., 2019

Trainable ISTA for Sparse Signal Recovery.
IEEE Trans. Signal Process., 2019

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

Compute-and-forward relaying with LDPC codes over QPSK scheme.
CoRR, 2019

Complex Field-Trainable ISTA for Linear and Nonlinear Inverse Problems.
CoRR, 2019

Trainable Projected Gradient Detector for Massive Overloaded MIMO Channels: Data-Driven Tuning Approach.
IEEE Access, 2019

Deep Learning-Aided Trainable Projected Gradient Decoding for LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward Relaying.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Deep Learning-Aided Projected Gradient Detector for Massive Overloaded MIMO Channels.
Proceedings of the 2019 IEEE International Conference on Communications, 2019

2018
Comments on "Nonadaptive Group Testing Based on Sparse Pooling Graphs".
IEEE Trans. Inf. Theory, 2018

Bounds on the Asymptotic Rate for Capacitive Crosstalk Avoidance Codes for On-Chip Buses.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Trainable Projected Gradient Detector for Massive Overloaded MIMO Channels: Data-driven Tuning Approach.
CoRR, 2018

Asymptotic Analysis of Spatial Coupling Coding for Compute-and-Forward Relaying.
CoRR, 2018

Deep Learning-Aided Iterative Detector for Massive Overloaded MIMO Channels.
CoRR, 2018

Joint Quantizer Optimization based on Neural Quantizer for Sum-Product Decoder.
CoRR, 2018

Asymptotic Achievable Rate of Two-Dimensional Constraint Codes based on Column by Column Encoding.
CoRR, 2018

Secure Computation-and-Forward Communication with Linear Codes.
Proceedings of the IEEE Information Theory Workshop, 2018

k-connectivity of Random Graphs and Random Geometric Graphs in Node Fault Model.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Analysis on Probabilistic Construction of Connected Dominating Sets over Regular Graph Ensembles.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Quantizer Optimization Based on Neural Quantizerfor Sum-Product Decoder.
Proceedings of the IEEE Global Communications Conference, 2018

Connectivity of Ad Hoc Wireless Networks with Node Faults.
Proceedings of the IEEE Global Communications Conference, 2018

2017
Nonadaptive Group Testing Based on Sparse Pooling Graphs.
IEEE Trans. Inf. Theory, 2017

Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

On Zero Error Capacity of Nearest Neighbor Error Channels with Multilevel Alphabet.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Band Splitting Permutations for Spatially Coupled LDPC Codes Achieving Asymptotically Optimal Burst Erasure Immunity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Construction of Fixed Rate Non-Binary WOM Codes Based on Integer Programming.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Fault Tolerance of Random Graphs with respect to Connectivity: Phase Transition in Logarithmic Average Degree.
CoRR, 2017

Proceedings of Workshop AEW10: Concepts in Information Theory and Communications.
CoRR, 2017

Analysis of breakdown probability of wireless sensor networks with unreliable relay nodes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Probabilistic Analysis of the Network Reliability Problem on Random Graph Ensembles.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Bitwise MAP Estimation for Group Testing Based on Holographic Transformation.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Performance Analysis Based on Density Evolution on Fault Erasure Belief Propagation Decoder.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Sparse Signal Recovery for Binary Compressed Sensing by Majority Voting Neural Networks.
CoRR, 2016

Iterative erasure correcting algorithm for q-ary reed-muller codes based on local correctability.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

A construction of non-binary WOM codes based on integer programming.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Performance analysis of fault erasure belief propagation decoder based on density evolution.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions.
CoRR, 2015

Band Splitting Permutations for Spatially Coupled LDPC Codes Enhancing Burst Erasure Immunity.
CoRR, 2015

Subgraph domatic problem and writing capacity of memory devices with restricted state transitions.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Evaluation of Symmetric Mutual Information of the Simplified TDMR Channel Model.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014
Finite Length Analysis on Listing Failure Probability of Invertible Bloom Lookup Tables.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Probabilistic Analysis on Minimum <i>s-t</i> Cut Capacity of Random Graphs with Specified Degree Distribution.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Bitwise MAP Algorithm for Group Testing based on Holographic Transformation.
CoRR, 2014

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

An analysis on non-adaptive group testing based on sparse pooling graphs.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

An analysis on minimum s-t cut capacity of random graphs with specified degree distribution.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices.
IEEE Trans. Inf. Theory, 2012

Probabilistic analysis of the network reliability problem on a random graph ensemble.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Average growth rate of low-density generator-matrix codes ensembles.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

A coding theoretic approach for evaluating accumulate distribution on minimum cut capacity of weighted random graphs.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

A New Direction for Counting Perfect Matchings.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Probabilistic Analysis on Network Reliability Problem
CoRR, 2011

A signal recovery algorithm for sparse matrix based compressed sensing
CoRR, 2011

Layered Index-less Indexed Flash Codes for improving average performance.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Average error exponent of undetected error probability of binary matrix ensembles.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Interior point decoding for linear vector channels based on convex optimization.
IEEE Trans. Inf. Theory, 2010

On the undetected error probability of binary matrix ensembles.
IEEE Trans. Inf. Theory, 2010

Gradient descent bit flipping algorithms for decoding LDPC codes.
IEEE Trans. Commun., 2010

LP Decodable Permuation Codes
CoRR, 2010

Statistical mechanical analysis of a typical reconstruction limit of compressed sensing.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
A cutting-plane method based on redundant rows for improving fractional distance.
IEEE J. Sel. Areas Commun., 2009

On Random Construction of a Bipolar Sensing Matrix with Compact Representation
CoRR, 2009

Typical reconstruction limit of compressed sensing based on Lp-norm minimization
CoRR, 2009

An LP decoding algorithm based on primal path-following interior point method.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Average Stopping Set Weight Distributions of Redundant Random Ensembles.
IEEE Trans. Inf. Theory, 2008

Asymptotic Concentration Behaviors of Linear Combinations of Weight Distributions on Random Linear Code Ensemble
CoRR, 2008

2007
Gradient Descent-Bit Flipping Algorithms for Decoding LDPC Codes
CoRR, 2007

Interior Point Decoding for Linear Vector Channels
CoRR, 2007

Average Stopping Set Weight Distribution of Redundant Random Matrix Ensembles.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Average Coset Weight Distribution of Combined LDPC Matrix Ensembles.
IEEE Trans. Inf. Theory, 2006

Ensemble Analysis on Syndrome Entropy of Binary Linear Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Average coset weight distributions of Gallager's LDPC code ensemble.
IEEE Trans. Inf. Theory, 2005

Low-density parity-check matrices for coding of correlated sources.
IEEE Trans. Inf. Theory, 2005

Average Coset Weight Distribution of Combined LDPC Matrix Ensemble
CoRR, 2005

An authentication scheme based on an low-density parity-check matrix.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel.
IEEE Trans. Inf. Theory, 2004

2003
An Iterative Decoding Algorithm for Channels with Additive Linear Dynamical Noise.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Low density parity check matrices for coding of multiple access networks.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
DC-free binary convolutional coding.
IEEE Trans. Inf. Theory, 2002

An Algorithm for Augmenting a Binary Linear Code up to Gilbert Bound and New Codes Obtained by the Algorithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

An Extension of Gallager Ensemble of Low Density Parity Check Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2001
Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function.
Des. Codes Cryptogr., 2001

An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC.
Proceedings of the Applied Algebra, 2001


  Loading...