Gui Liang Feng

Proceedings of the Novel Algorithms and Techniques in Telecommunications and Networking, 2008

2007

ADENS: Efficient address determination for mobile grids.

[BibT_eX]

[DOI]

Nian-Feng Tzeng

Hongyi Wu

Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

2005

New Efficient MDS Array Codes for RAID Part II: Rabin-Like Codes for Tolerating Multiple (greater than or equal to 4) Disk Failures.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

A generic algorithm to find all common intervals of two permutations.

[BibT_eX]

[DOI]

Yujiang Shan

Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

2004

Algebraic geometric code based IP traceback.

[BibT_eX]

[DOI]

Gesan Wang

Proceedings of the 23rd IEEE International Performance Computing and Communications Conference, 2004

2003

Practical Construction for Multicast Re-keying Schemes Using R-S Code and A-G Code.

[BibT_eX]

Roberta Houston

Informatica (Slovenia), 2003

Improved Algebraic Traitor Tracing Scheme.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2003

2002

A novel packet loss recovery for video stream transmission over networks.

[BibT_eX]

[DOI]

Roberta Houston

Kuldeep Rawat

Proceedings of the Third International Workshop on Digital and Computational Video, 2002

2000

Construction of Improved Geometric Goppa Codes from Klein Curves and Klein-like Curves.

[BibT_eX]

[DOI]

Mahadev S. Kolluru

Appl. Algebra Eng. Commun. Comput., 2000

1999

Correction to "New double-byte error-correcting codes for memory systems".

[BibT_eX]

[DOI]

Xin-Wen Wu

IEEE Trans. Inf. Theory, 1999

1998

New Double-Byte Error-Correcting Codes for Memory Systems.

[BibT_eX]

[DOI]

Xinwen Wu

IEEE Trans. Inf. Theory, 1998

Grouping Algorithm for Lossless Data Compression.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1996

Resource Allocation in Cube Network Systems Based on the Covering Radius.

[BibT_eX]

[DOI]

Nian-Feng Tzeng

IEEE Trans. Parallel Distributed Syst., 1996

The New Minimum Distance Bounds of Goppa Codes and Their Decoding.

[BibT_eX]

[DOI]

Chang-Seop Park

Des. Codes Cryptogr., 1996

1995

Improved geometric Goppa codes. I. Basic theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

Improved lower bounds on the sizes of error-correcting codes for list decoding.

[BibT_eX]

[DOI]

Victor K.-W. Wei

IEEE Trans. Inf. Theory, 1994

Simplified understanding and efficient decoding of a class of algebraic-geometric codes.

[BibT_eX]

[DOI]

Victor K.-W. Wei

IEEE Trans. Inf. Theory, 1994

A new procedure for decoding cyclic and BCH codes up to actual minimum distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

A simple approach for construction of algebraic-geometric codes from affine plane curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Error Correcting Codes over Z_{2^m} for Algorithm Based Fault Tolerance.

[BibT_eX]

[DOI]

Mahadev S. Kolluru

IEEE Trans. Computers, 1994

1993

Decoding algebraic-geometric codes up to the designed minimum distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Novel Totally Self-Checking Berger Code Checker Designs Based on Generalized Berger Code Partitioning.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1993

On Resource Allocation in Binary n-Cube Network Systems.

[BibT_eX]

[DOI]

Nian-Feng Tzeng

Proceedings of the 1993 International Conference on Parallel Processing, 1993

A Class of Algebraic Geometric Codes from Curves in High-Dimensional Projective Spaces.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

On the generalized Hamming weights of several classes of cyclic codes.

[BibT_eX]

[DOI]

Victor K.-W. Wei

IEEE Trans. Inf. Theory, 1992

Efficient Multiple Unidirectional Byte Error-Detecting Codes for Computer Memory Systems.

[BibT_eX]

[DOI]

Mahadev S. Kolluru

Proceedings of the Digest of Papers: FTCS-22, 1992

1991

Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1989

A generalized Euclidean algorithm for multisequence shift-register synthesis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

A VLSI Architecture for Fast Inversion in GF(2^m).

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1989

1985

Further results about the cyclicity of generalized Goppa codes.

[BibT_eX]

[DOI]

Discret. Math., 1985

Generalized threshold decoding of cyclic codes.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding

[BibT_eX]

[DOI]

Inf. Control., May, 1984

An algorithm of complete decoding of double-error-correcting Goppa codes.

[BibT_eX]

[DOI]