| 2008 |
|---|
| 13 | EE | Tadashi Wadayama:
Asymptotic Concentration Behaviors of Linear Combinations of Weight Distributions on Random Linear Code Ensemble
CoRR abs/0803.1025: (2008) |
| 2007 |
|---|
| 12 | EE | Tadashi Wadayama:
Interior Point Decoding for Linear Vector Channels
CoRR abs/0705.3990: (2007) |
| 11 | EE | Tadashi Wadayama:
Average Stopping Set Weight Distribution of Redundant Random Matrix Ensembles
CoRR abs/0705.3992: (2007) |
| 10 | EE | Tadashi Wadayama:
On Undetected Error Probability of Binary Matrix Ensembles
CoRR abs/0705.3995: (2007) |
| 9 | EE | Tadashi Wadayama,
Masayuki Yagita,
Yuuki Funahashi,
Shogo Usami,
Ichi Takumi:
Gradient Descent-Bit Flipping Algorithms for Decoding LDPC Codes
CoRR abs/0711.0261: (2007) |
| 2006 |
|---|
| 8 | EE | Tadashi Wadayama:
Average Coset Weight Distribution of Combined LDPC Matrix Ensembles.
IEEE Transactions on Information Theory 52(11): 4856-4866 (2006) |
| 2005 |
|---|
| 7 | EE | Tadashi Wadayama:
Average Coset Weight Distribution of Combined LDPC Matrix Ensemble
CoRR abs/cs/0504011: (2005) |
| 6 | EE | Jun Muramatsu,
Tomohiko Uyematsu,
Tadashi Wadayama:
Low-density parity-check matrices for coding of correlated sources.
IEEE Transactions on Information Theory 51(10): 3645-3654 (2005) |
| 5 | EE | Tadashi Wadayama:
Average coset weight distributions of Gallager's LDPC code ensemble.
IEEE Transactions on Information Theory 51(7): 2715-2721 (2005) |
| 2004 |
|---|
| 4 | | Tadashi Wadayama:
An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel.
IEEE Transactions on Information Theory 50(2): 331-337 (2004) |
| 2002 |
|---|
| 3 | | Tadashi Wadayama,
A. J. Han Vinck:
DC-free binary convolutional coding.
IEEE Transactions on Information Theory 48(1): 162-173 (2002) |
| 2001 |
|---|
| 2 | EE | Tadashi Wadayama:
An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC.
AAECC 2001: 353-362 |
| 1 | | Tadashi Wadayama,
Toru Hada,
Koichiro Wakasugi,
Masao Kasahara:
Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function.
Des. Codes Cryptography 23(1): 23-34 (2001) |
