Sian-Jheng Lin

Orcid: 0000-0002-6309-2876

According to our database1, Sian-Jheng Lin authored at least 90 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
High-Capacity Framework for Reversible Data Hiding Using Asymmetric Numeral Systems.
IEEE Trans. Knowl. Data Eng., December, 2024

Accelerating Huffman Encoding Using 512-Bit SIMD Instructions.
IEEE Trans. Consumer Electron., February, 2024

A Construction of Evolving 3-threshold Secret Sharing Scheme with Perfect Security and Smaller Share Size.
CoRR, 2024

A Construction of Evolving k-threshold Secret Sharing Scheme over A Polynomial Ring.
CoRR, 2024

An Efficient Inversion Encoding Scheme with k INV Signals on Bus Transmission.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Prefix Coding Scheme Supporting Direct Access Without Auxiliary Space.
IEEE Trans. Knowl. Data Eng., December, 2023

Reed-Solomon Coding Algorithms Based on Reed-Muller Transform for Any Number of Parities.
IEEE Trans. Computers, September, 2023

A New Metric and the Construction for Evolving 2-Threshold Secret Sharing Schemes Based on Prefix Coding of Integers.
IEEE Trans. Commun., May, 2023

Some Results for the Redundancy Bound of the Optimal Ternary AIFV Codes.
IEEE Trans. Commun., 2023

An Entropy Coding Based on Binary Encoding for Mixed-Radix Digits.
CoRR, 2023

A Novel Reversible Data Hiding Scheme Based on Asymmetric Numeral Systems.
CoRR, 2023

An Efficient Reed-Solomon Erasure Code over Cantor-constructed Binary Extension Finite Fields.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Computation of Rate-Distortion-Perception Functions With Wasserstein Barycenter.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Reduced-Complexity Erasure Decoding of Low-Rate Reed-Solomon Codes Based on LCH-FFT.
Proceedings of the IEEE International Symposium on Information Theory, 2023

An Early-Termination Method for the Welch-Berlekamp Algorithm.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Parallel ANS Coder with Reduced Decoding Error Diffusion.
Proceedings of the Data Compression Conference, 2023

Compressing the Trees of Canonical Binary AIFV Coding.
Proceedings of the Data Compression Conference, 2023

2022
A Tighter Upper Bound of the Expansion Factor for Universal Coding of Integers and Its Code Constructions.
IEEE Trans. Commun., 2022

A New Metric and Its Scheme Construction for Evolving 2-Threshold Secret Sharing Schemes.
CoRR, 2022

Generalized Universal Coding of Integers.
CoRR, 2022

Data Integrity Check in Distributed Storage Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2022

A New Coding Scheme for Matrix-Vector Multiplication via Universal Decodable Matrices.
Proceedings of the IEEE International Symposium on Information Theory, 2022

An Entropy Coding Based on Binary Encoding for Mixed-Radix Digits.
Proceedings of the Data Compression Conference, 2022

Compressing the Tree of Canonical Huffman Coding.
Proceedings of the Data Compression Conference, 2022

SortComp (Sort-and-Compress) - Towards a Universal Lossless Compression Scheme for Matrix and Tabular Data.
Proceedings of the Data Compression Conference, 2022

2021
Update Bandwidth for Distributed Storage.
IEEE Trans. Inf. Theory, 2021

On the Minimum of the Expansion Factor for Universal Coding of Integers.
IEEE Trans. Commun., 2021

Cyclic Properties and Pipeline Implementation of the Fletcher Checksum.
IEEE Trans. Commun., 2021

On fast Fourier transform-based decoding of Reed-Solomon codes.
Int. J. Ad Hoc Ubiquitous Comput., 2021

A simplified variant of tabled asymmetric numeral systems with a smaller look-up table.
Distributed Parallel Databases, 2021

Local Correctabilities and Dual Codes of Symmetric Reed-Muller Codes.
Proceedings of the IEEE Information Theory Workshop, 2021

Generalized Universal Coding of Integers.
Proceedings of the IEEE Information Theory Workshop, 2021

Efficient Codebook Constructions of AIVF Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Symmetric Reed-Muller Codes.
IEEE Trans. Commun., 2020

Variants of Golomb Coding and the n-ary Versions.
IEEE Trans. Commun., 2020

Fast Encoding Algorithms for Reed-Solomon Codes With Between Four and Seven Parity Symbols.
IEEE Trans. Computers, 2020

Removing Redundancy in Little-Endian Base 128 and the Efficient Decoding Approach.
IEEE Commun. Lett., 2020

A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression.
IEEE Access, 2020

On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Reversible Data Hiding in Color Image With Grayscale Invariance.
IEEE Trans. Circuits Syst. Video Technol., 2019

New Locally Correctable Codes Based on Projective Reed-Muller Codes.
IEEE Trans. Commun., 2019

On the Security of Secret Sharing Over a Ring and the Fast Implementation.
IEEE Signal Process. Lett., 2019

Irregular MDS Array Codes With Fewer Parity Symbols.
IEEE Commun. Lett., 2019

A Class of In-Place Linear Transformations Possessing the Cache-Oblivious Property.
IEEE Access, 2019

Reducing the Bandwidth of Block Propagation in Bitcoin Network With Erasure Coding.
IEEE Access, 2019

Mining Strategies for Completing the Longest Blockchain.
IEEE Access, 2019

Bitcoin Blockchain Compression Algorithm for Blank Node Synchronization.
Proceedings of the 11th International Conference on Wireless Communications and Signal Processing, 2019

Arithmetic Coding Based on Reflected Binary Codes.
Proceedings of the Ninth International Workshop on Signal Design and its Applications in Communications, 2019

Update Bandwidth for Distributed Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
An Encoding Algorithm of Triply Extended Reed-Solomon Codes With Asymptotically Optimal Complexities.
IEEE Trans. Commun., 2018

Extended Versions of Polynomial Remainder Codes and Chinese Remainder Codes.
IEEE Commun. Lett., 2018

On the Arithmetic Complexities of Hamming Codes and Hadamard Codes.
CoRR, 2018

2017
On the Local Correctabilities of Projective Reed-Muller Codes.
CoRR, 2017

Principal pivot transforms on radix-2 DFT-type matrices.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Novel Polynomial Basis With Fast Fourier Transform and Its Application to Reed-Solomon Erasure Codes.
IEEE Trans. Inf. Theory, 2016

FFT Algorithm for Binary Extension Finite Fields and Its Application to Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2016

RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities.
Proceedings of the 27th IEEE Annual International Symposium on Personal, 2016

On locality of Generalized Reed-Muller codes over the broadcast erasure channel.
Proceedings of the IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, 2016

2015
A Unified Form of Exact-MSR Codes via Product-Matrix Frameworks.
IEEE Trans. Inf. Theory, 2015

Efficient Frequency-Domain Decoding Algorithms for Reed-Solomon Codes.
CoRR, 2015

On network coding and modulation mapping for three-phase bidirectional relaying.
Proceedings of the 26th IEEE Annual International Symposium on Personal, 2015

2014
Novel Repair-by-Transfer Codes and Systematic Exact-MBR Codes with Lower Complexities and Smaller Field Sizes.
IEEE Trans. Parallel Distributed Syst., 2014

Fast Ecoding/Decoding Algorithms for Reed-Solomon Erasure Codes.
CoRR, 2014

Transmission Protocol Design for Binary Physical Network Coded Multi-Way Relay Networks.
Proceedings of the IEEE 79th Vehicular Technology Conference, 2014

On the fault-tolerance of unified-form exact-MSR codes.
Proceedings of the 6th International Symposium on Communications, 2014

Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Symbol and Bit Mapping Optimization for Physical-Layer Network Coding with Pulse Amplitude Modulation.
IEEE Trans. Wirel. Commun., 2013

An Efficient (n, k) Information Dispersal Algorithm Based on Fermat Number Transforms.
IEEE Trans. Inf. Forensics Secur., 2013

A method for the construction of hierarchical generalized space shift keying (GSSK) modulation for unequal error protection.
Phys. Commun., 2013

An unified form of exact-MSR codes via product-matrix framework.
Proceedings of the 24th IEEE Annual International Symposium on Personal, 2013

The split-radix fast Fourier transforms with radix-4 butterfly units.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2013

Diffie-Hellman key distribution in wireless multi-way relay networks.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2013

Joint-denoise-and-forward protocol for multi-way relay networks.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2013

2012
New Space Shift Keying Modulation with Hamming Code-Aided Constellation Design.
IEEE Wirel. Commun. Lett., 2012

A* Algorithm Inspired Memory-Efficient Detection for MIMO Systems.
IEEE Wirel. Commun. Lett., 2012

Efficient Implementation of the MIMO Sphere Detector: Architecture and Complexity Analysis.
IEEE Trans. Veh. Technol., 2012

The Scalar Scheme for Reversible Information-Embedding in Gray-Scale Signals: Capacity Evaluation and Code Constructions.
IEEE Trans. Inf. Forensics Secur., 2012

A Probabilistic Model of $(t, n)$ Visual Cryptography Scheme With Dynamic Group.
IEEE Trans. Inf. Forensics Secur., 2012

Energy Efficient Transmission over Space Shift Keying Modulated MIMO Channels.
IEEE Trans. Commun., 2012

Optimal (2, n) and (2, infinity) visual secret sharing by generalized random grids.
J. Vis. Commun. Image Represent., 2012

An Efficient (n, k) Information Dispersal Algorithm for High Code Rate System over Fermat Fields.
IEEE Commun. Lett., 2012

Hierarchical Space Shift Keying for Unequal Error Protection.
IEEE Commun. Lett., 2012

Detection of space shift keying signaling in large MIMO systems.
Proceedings of the 8th International Wireless Communications and Mobile Computing Conference, 2012

A block based (t, n) visual cryptography scheme for unbounded n and t=2, 3.
Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, 2012

2010
Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expansion.
J. Vis. Commun. Image Represent., 2010

Authentication and recovery of an image by sharing and lattice-embedding.
J. Electronic Imaging, 2010

Reversible JPEG-Based Hiding Method with High Hiding-Ratio.
Int. J. Pattern Recognit. Artif. Intell., 2010

2009
Non-expansible Flip-flop Visual Cryptography with Perfect Security.
Proceedings of the Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2009), 2009

2008
Authentication and cross-recovery for multiple images.
J. Electronic Imaging, 2008

2007
VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches.
Pattern Recognit., 2007


  Loading...