2007 |
33 | EE | Nian-Feng Tzeng,
Hongyi Wu,
Gui Liang Feng:
ADENS: Efficient address determination for mobile grids.
ICPADS 2007: 1-8 |
2005 |
32 | EE | Gui Liang Feng,
Yujiang Shan:
A generic algorithm to find all common intervals of two permutations.
CSB Workshops 2005: 85-88 |
31 | EE | Gui Liang Feng,
Robert H. Deng,
Feng Bao,
Jia-Chen Shen:
New Efficient MDS Array Codes for RAID Part II: Rabin-Like Codes for Tolerating Multiple (greater than or equal to 4) Disk Failures.
IEEE Trans. Computers 54(12): 1473-1483 (2005) |
30 | EE | Gui Liang Feng,
Robert H. Deng,
Feng Bao,
Jia-Chen Shen:
New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures.
IEEE Trans. Computers 54(9): 1071-1080 (2005) |
2003 |
29 | EE | Chunyan Bai,
Gui Liang Feng:
Improved Algebraic Traitor Tracing Scheme.
ACNS 2003: 217-227 |
28 | | Chunyan Bai,
Roberta Houston,
Gui Liang Feng:
Practical Construction for Multicast Re-keying Schemes Using R-S Code and A-G Code.
Informatica (Slovenia) 27(1): 39-48 (2003) |
2002 |
27 | | Chunyan Bai,
Roberta Houston,
Gui Liang Feng:
Practical Construction for Multicast Re-keying Schemes Using R-S Code and A-G Code.
Informatica (Slovenia) 26(3): (2002) |
2000 |
26 | EE | Mahadev S. Kolluru,
Gui Liang Feng,
T. R. N. Rao:
Construction of Improved Geometric Goppa Codes from Klein Curves and Klein-like Curves.
Appl. Algebra Eng. Commun. Comput. 10(6): 433-464 (2000) |
1999 |
25 | | Gui Liang Feng,
Xin-Wen Wu,
T. R. N. Rao:
Correction to "New double-byte error-correcting codes for memory systems".
IEEE Transactions on Information Theory 45(6): 2209 (1999) |
1998 |
24 | EE | Nasser Tadayon,
Gui Liang Feng,
T. R. N. Rao,
E. Hinds:
Grouping Algorithm for Lossless Data Compression.
Data Compression Conference 1998: 574 |
23 | | Gui Liang Feng,
Xinwen Wu,
T. R. N. Rao:
New Double-Byte Error-Correcting Codes for Memory Systems.
IEEE Transactions on Information Theory 44(3): 1152-1163 (1998) |
1997 |
22 | | Gui Liang Feng,
Thammavarapu R. N. Rao,
G. A. Berg,
J. Zhu:
Generalized Bezout's theorem and its applications in coding theory.
IEEE Transactions on Information Theory 43(6): 1799-1810 (1997) |
1996 |
21 | | Chang-Seop Park,
Gui Liang Feng,
Kenneth K. Tzeng:
The New Minimum Distance Bounds of Goppa Codes and Their Decoding.
Des. Codes Cryptography 9(2): 157-176 (1996) |
20 | EE | Nian-Feng Tzeng,
Gui Liang Feng:
Resource Allocation in Cube Network Systems Based on the Covering Radius.
IEEE Trans. Parallel Distrib. Syst. 7(4): 328-342 (1996) |
1995 |
19 | | Gui Liang Feng,
Thammavarapu R. N. Rao:
Improved geometric Goppa codes. I. Basic theory.
IEEE Transactions on Information Theory 41(6): 1678-1693 (1995) |
1994 |
18 | | Gui Liang Feng,
T. R. N. Rao,
Mahadev S. Kolluru:
Error Correcting Codes over Z_{2^m} for Algorithm Based Fault Tolerance.
IEEE Trans. Computers 43(3): 370-374 (1994) |
17 | | Victor K.-W. Wei,
Gui Liang Feng:
Improved lower bounds on the sizes of error-correcting codes for list decoding.
IEEE Transactions on Information Theory 40(2): 558- (1994) |
16 | | Gui Liang Feng,
Thammavarapu R. N. Rao:
A simple approach for construction of algebraic-geometric codes from affine plane curves.
IEEE Transactions on Information Theory 40(4): 1003-1012 (1994) |
15 | | Gui Liang Feng,
Victor K.-W. Wei,
Thammavarapu R. N. Rao,
Kenneth K. Tzeng:
Simplified understanding and efficient decoding of a class of algebraic-geometric codes.
IEEE Transactions on Information Theory 40(4): 981-1002 (1994) |
14 | | Gui Liang Feng,
Kenneth K. Tzeng:
A new procedure for decoding cyclic and BCH codes up to actual minimum distance.
IEEE Transactions on Information Theory 40(5): 1364-1374 (1994) |
1993 |
13 | | Gui Liang Feng,
T. R. N. Rao:
A Class of Algebraic Geometric Codes from Curves in High-Dimensional Projective Spaces.
AAECC 1993: 132-146 |
12 | | Nian-Feng Tzeng,
Gui Liang Feng:
On Resource Allocation in Binary n-Cube Network Systems.
ICPP 1993: 209-212 |
11 | | T. R. N. Rao,
Gui Liang Feng,
Mahadev S. Kolluru,
Jien-Chung Lo:
Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning.
IEEE Trans. Computers 42(8): 1020-1024 (1993) |
10 | | Gui Liang Feng,
Thammavarapu R. N. Rao:
Decoding algebraic-geometric codes up to the designed minimum distance.
IEEE Transactions on Information Theory 39(1): 37-45 (1993) |
1992 |
9 | | T. R. N. Rao,
Gui Liang Feng,
Mahadev S. Kolluru:
Efficient Multiple Unidirectional Byte Error-Detecting Codes for Computer Memory Systems.
FTCS 1992: 502-509 |
8 | | Gui Liang Feng,
Kenneth K. Tzeng,
Victor K.-W. Wei:
On the generalized Hamming weights of several classes of cyclic codes.
IEEE Transactions on Information Theory 38(3): 1125- (1992) |
1991 |
7 | | Gui Liang Feng,
Kenneth K. Tzeng:
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes.
IEEE Transactions on Information Theory 37(5): 1274-1287 (1991) |
6 | | Gui Liang Feng,
Kenneth K. Tzeng:
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations.
IEEE Transactions on Information Theory 37(6): 1716- (1991) |
1989 |
5 | | Gui Liang Feng:
A VLSI Architecture for Fast Inversion in GF(2^m).
IEEE Trans. Computers 38(10): 1383-1386 (1989) |
4 | | Gui Liang Feng,
Kenneth K. Tzeng:
A generalized Euclidean algorithm for multisequence shift-register synthesis.
IEEE Transactions on Information Theory 35(3): 584-594 (1989) |
1985 |
3 | EE | Gui Liang Feng:
Generalized threshold decoding of cyclic codes.
Discrete Mathematics 56(2-3): 147-154 (1985) |
1984 |
2 | | Gui Liang Feng,
Kenneth K. Tzeng:
An algorithm of complete decoding of double-error-correcting Goppa codes.
AAECC 1984: 154-160 |
1 | | Gui Liang Feng,
Kenneth K. Tzeng:
On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding
Information and Control 61(2): 132-146 (1984) |