Fang-Wei Fu

Orcid: 0000-0002-9696-8977

Affiliations:
  • Nankai University, Chern Institute of Mathematics and LPMC, Tianjin, China
  • National University of Singapore, Temasek Laboratories (former)


According to our database1, Fang-Wei Fu authored at least 287 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Further Study of Vectorial Dual-Bent Functions.
IEEE Trans. Inf. Theory, October, 2024

Bounds and Constructions of Singleton-Optimal Locally Repairable Codes With Small Localities.
IEEE Trans. Inf. Theory, October, 2024

Some new constructions of optimal linear codes and alphabet-optimal (r,δ )-locally repairable codes.
Des. Codes Cryptogr., October, 2024

Optimal ternary locally repairable codes.
Des. Codes Cryptogr., September, 2024

Two modifications for Loidreau's code-based cryptosystem.
Appl. Algebra Eng. Commun. Comput., September, 2024

New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes.
IEEE Trans. Inf. Theory, July, 2024

Nonexistence of perfect permutation codes under the ℓ <sub>∞ </sub>-metric.
Appl. Algebra Eng. Commun. Comput., May, 2024

Constructing and expressing Hermitian self-dual cyclic codes of length p<sup>s</sup> over ${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$.
Appl. Algebra Eng. Commun. Comput., May, 2024

Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks.
Des. Codes Cryptogr., April, 2024

On generalized quasi-cyclic codes over Z4.
Discret. Math., March, 2024

Quantum MDS codes with new length and large minimum distance.
Discret. Math., January, 2024

A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes.
Theor. Comput. Sci., 2024

Constructions of rotation symmetric Boolean functions satisfying almost all cryptographic criteria.
Theor. Comput. Sci., 2024

Improvements on the 4-adic complexity of a class of quaternary sequences.
RAIRO Theor. Informatics Appl., 2024

Optimizing code allocation for hybrid on-chip memory in IoT systems.
Integr., 2024

Weight distribution of double cyclic codes over Fq+uFq.
Finite Fields Their Appl., 2024

Association schemes arising from non-weakly regular bent functions.
CoRR, 2024

Self-Orthogonal Codes from Vectorial Dual-Bent Functions.
CoRR, 2024

A Perfect Ideal Hierarchical Secret Sharing Scheme Based on the CRT for Polynomial Rings.
Proceedings of the IEEE International Symposium on Information Theory, 2024

A New Multi-Receiver Authentication Scheme for General Access Structure.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Bent Partitions, Vectorial Dual-Bent Functions and Partial Difference Sets.
IEEE Trans. Inf. Theory, November, 2023

Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes.
Finite Fields Their Appl., October, 2023

New MDS EAQECCs derived from constacyclic codes over Fq2+vFq2.
Discret. Math., September, 2023

Constructions of linear codes with two or three weights from vectorial dual-bent functions.
Discret. Math., August, 2023

Hulls of double cyclic codes.
Finite Fields Their Appl., June, 2023

Weight distributions of generalized quasi-cyclic codes over Fq+uFq.
Finite Fields Their Appl., June, 2023

An explicit expression for all distinct self-dual cyclic codes of length p<sup>k</sup> over Galois ring $\mathrm{GR}(p^2,m)$.
Appl. Algebra Eng. Commun. Comput., May, 2023

Perfect LRCs and k-optimal LRCs.
Des. Codes Cryptogr., April, 2023

Weight distributions of Q2DC codes over finite fields.
Des. Codes Cryptogr., March, 2023

Some new classes of quaternary sequences with low autocorrelation property via two binary cyclotomic sequences.
J. Appl. Math. Comput., February, 2023

Improved Random Grid-based Cheating Prevention Visual Cryptography Using Latin Square.
ACM Trans. Multim. Comput. Commun. Appl., 2023

Learning with Errors over Group Rings Constructed by Semi-direct Product.
IACR Cryptol. ePrint Arch., 2023

Hermitian duality of left dihedral codes over finite fields.
Discret. Math., 2023

Minimal linear codes from defining sets over Fp+uFp.
Discret. Math., 2023

New results on vectorial dual-bent functions and partial difference sets.
Des. Codes Cryptogr., 2023

Linear codes with few weights from non-weakly regular plateaued functions.
CoRR, 2023

New frequency-hopping sequence sets with good parameters under aperiodic hamming correlation.
Cryptogr. Commun., 2023

Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound.
Adv. Math. Commun., 2023

Generic constructions of MDS Euclidean self-dual codes via GRS codes.
Adv. Math. Commun., 2023

MacWilliams-Like Identities for Certain Vectorial Bent Functions.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Some Constructions of Perfect and k-optimal (r,δ)-LRCs.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
$${\mathbb {F}}_qR$$-Linear skew cyclic codes.
J. Appl. Math. Comput., June, 2022

$$\pmb {{\mathbb {F}}}_q$$-Linear skew cyclic codes over $$\pmb {{\mathbb {F}}}_{q^2}$$ and their applications of quantum codes construction.
J. Appl. Math. Comput., February, 2022

On the Duals of Generalized Bent Functions.
IEEE Trans. Inf. Theory, 2022

New (<i>k</i>, <i>l</i>, <i>m</i>)-verifiable multi-secret sharing schemes based on XTR public key system.
Theor. Comput. Sci., 2022

Constructions and Weight Distributions of Optimal Locally Repairable Codes.
IEEE Trans. Commun., 2022

(x<sup>n-(a+bw), ξ</sup> , η )-skew constacyclic codes over $\mathbb {F}_{q}+w\mathbb {F}_{q}$ and their applications in quantum codes.
Quantum Inf. Process., 2022

A cheating immune (k, n) visual cryptography scheme by using the rotation of shares.
Multim. Tools Appl., 2022

A contrast improved OR and XOR based (k, n) visual cryptography scheme without pixel expansion.
J. Vis. Commun. Image Represent., 2022

A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations.
Inf. Sci., 2022

McEliece-type encryption based on Gabidulin codes with no hidden structure.
IACR Cryptol. ePrint Arch., 2022

Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity.
Discret. Math., 2022

Weight distribution of double cyclic codes over Galois rings.
Des. Codes Cryptogr., 2022

Bounds and Constructions of Singleton-Optimal Locally Repairable Codes with Small Localities.
CoRR, 2022

On generalized quasi-cyclic codes over Z<sub>4</sub>.
CoRR, 2022

Post-quantum Multi-stage Secret Sharing Schemes using Inhomogeneous Linear Recursion and Ajtai's Function.
CoRR, 2022

Some Results on the Improved Bound and Construction of Optimal (r, δ) LRCs.
CoRR, 2022

Results on the nonexistence of bent-negabent rotation symmetric Boolean functions.
Cryptogr. Commun., 2022

Linear ℓ-intersection pairs of MDS codes and their applications to AEAQECCs.
Cryptogr. Commun., 2022

New constructions of self-dual generalized Reed-Solomon codes.
Cryptogr. Commun., 2022

Two constructions of low-hit-zone frequency-hopping sequence sets.
Adv. Math. Commun., 2022

Self-dual cyclic codes over ${\mathbb {Z}}_4$ of length 4n.
Appl. Algebra Eng. Commun. Comput., 2022

Three New Constructions of 5-valued Spectrum Functions with Totally Disjoint Spectra Duals.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Optimal and Almost Optimal Cyclic (r, δ)-LRCs With Large Code Lengths.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Some Results on the Improved Bound and Construction of Optimal $(r, \ \delta)$ LRCs.
Proceedings of the IEEE/CIC International Conference on Communications in China, 2022

Cryptanalysis and Repair of a Gabidulin Code Based Cryptosystem from ACISP 2018.
Proceedings of the Information Security and Privacy - 27th Australasian Conference, 2022

2021
New Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes From Their Zeros.
IEEE Trans. Inf. Theory, 2021

Construction of MDS Euclidean Self-Dual Codes via Two Subsets.
IEEE Trans. Inf. Theory, 2021

Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6.
IEEE Trans. Inf. Theory, 2021

On the Construction of Multiply Constant-Weight Codes.
Int. J. Found. Comput. Sci., 2021

Bounds on Covering Radius of F<sub>2</sub>R-Linear Codes.
IEEE Commun. Lett., 2021

On the Dual of Generalized Bent Functions.
IACR Cryptol. ePrint Arch., 2021

Some Generic Constructions of Generalized Plateaued Functions.
IACR Cryptol. ePrint Arch., 2021

Expanded Gabidulin Codes and Their Application to Cryptography.
IACR Cryptol. ePrint Arch., 2021

Nonexistence of perfect permutation codes under the Kendall τ-metric.
Des. Codes Cryptogr., 2021

Polynomial-Time Key Recovery Attack on the Lau-Tan Cryptosystem Based on Gabidulin Codes.
CoRR, 2021

Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel.
CoRR, 2021

On pure MDS asymmetric entanglement-assisted quantum error-correcting codes.
CoRR, 2021

Semilinear transformations in coding theory and their application to cryptography.
CoRR, 2021

The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks.
CoRR, 2021

New constructions of MDS self-dual and self-orthogonal codes via GRS codes.
CoRR, 2021

(σ, δ)-Skew quasi-cyclic codes over the ring $\mathbb {Z}_{4}+u\mathbb {Z}_{4}$.
Cryptogr. Commun., 2021

Some optimal cyclic 픽<sub>q</sub>-linear 픽<sub>q<sup>t</sup></sub>-codes.
Adv. Math. Commun., 2021

An explicit representation and enumeration for negacyclic codes of length 2<sup>kn</sup> over ℤ<sub>4+uℤ<sub>4</sub></sub>.
Adv. Math. Commun., 2021

On self-duality and hulls of cyclic codes over $\frac{\mathbb {F}_{2^m}[u]}{\langle u^k\rangle }$ with oddly even length.
Appl. Algebra Eng. Commun. Comput., 2021

On Optimal Quaternary Locally Repairable Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Singleton-Optimal LRCs and Perfect LRCs via Cyclic Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach.
IEEE Trans. Inf. Theory, 2020

Local-Encoding-Preserving Secure Network Coding.
IEEE Trans. Inf. Theory, 2020

Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs.
IEEE Trans. Inf. Theory, 2020

Self-Dual Binary $[8m, \, \, 4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$.
IEEE Trans. Inf. Theory, 2020

\({\mathbb {F}}_qR\) -linear skew constacyclic codes and their application of constructing quantum codes.
Quantum Inf. Process., 2020

Constructions of (r, t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields.
Int. J. Found. Comput. Sci., 2020

New Constructions of Codebooks Nearly Meeting the Welch Bound.
Int. J. Found. Comput. Sci., 2020

New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem.
IET Inf. Secur., 2020

New Constructions of Near-Complete External Difference Families Over Galois Rings.
IEEE Commun. Lett., 2020

New (k, l, m)-verifiable multi-secret sharing schemes based on XTR public key system.
IACR Cryptol. ePrint Arch., 2020

Optimal cyclic (<i>r</i>, <i>δ</i>) locally repairable codes with unbounded length.
Finite Fields Their Appl., 2020

Construction and enumeration for self-dual cyclic codes of even length over F2m+uF2m.
Finite Fields Their Appl., 2020

Several families of q-ary minimal linear codes with wmin∕wmax≤(q-1)∕q.
Discret. Math., 2020

On matrix-product structure of repeated-root constacyclic codes over finite fields.
Discret. Math., 2020

Snake-in-the-box codes under the ℓ <sub>∞ </sub>-metric for rank modulation.
Des. Codes Cryptogr., 2020

Deterministic construction of compressed sensing matrices from constant dimension codes.
Discret. Appl. Math., 2020

A Note on Self-Dual Generalized Reed-Solomon Codes.
CoRR, 2020

The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes.
Cryptogr. Commun., 2020

On the algebraic structure of quasi-cyclic codes of index $1\frac {1}{2}$.
Cryptogr. Commun., 2020

Correcting mistakes in the paper "A mass formula for negacyclic codes of length 2<sup>k</sup> and some good negacyclic codes over $\mathbb {Z}_{4}+u\mathbb {Z}_{4}$" [Cryptogr. Commun. (2017) 9: 241-272].
Cryptogr. Commun., 2020

Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Perfect LRCs and k-Optimal LRCs.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Balanced $$2^k$$ 2 k -variable rotation symmetric Boolean functions with optimal algebraic immunity.
J. Appl. Math. Comput., October, 2019

The Decoding Error Probability of Linear Codes Over the Erasure Channel.
IEEE Trans. Inf. Theory, 2019

Some New Constructions of Quantum MDS Codes.
IEEE Trans. Inf. Theory, 2019

New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes.
IEEE Trans. Inf. Theory, 2019

Constructions of Optimal $(r, \delta)$ Locally Repairable Codes via Constacyclic Codes.
IEEE Trans. Commun., 2019

Secondary constructions of RSBFs with good cryptographic properties.
Inf. Process. Lett., 2019

Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2.
Int. J. Found. Comput. Sci., 2019

On the Construction of Binary Optimal LCD Codes with Short Length.
Int. J. Found. Comput. Sci., 2019

A Generalized Construction of Codebook Asymptotically Meeting the Welch Bound.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A Generalized Construction of Asymptotically Optimal Codebooks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A construction of <i>V</i><sub><i>h</i></sub>-sequences and its application to binary asymmetric error-correcting codes.
Finite Fields Their Appl., 2019

A class of repeated-root constacyclic codes over Fpm[u]/〈ue〉 of Type 2.
Finite Fields Their Appl., 2019

The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length.
Discret. Math., 2019

Type 2 constacyclic codes over F2m[u]∕〈u3〉 of oddly even length.
Discret. Math., 2019

On self-duality and hulls of cyclic codes over F<sub>2<sup>m</sup></sub>[u]/⟨u<sup>k</sup>⟩ with oddly even length.
CoRR, 2019

Construction and enumeration for self-dual cyclic codes of even length over F<sub>2<sup>m</sup></sub> + uF<sub>2<sup>m</sup></sub>.
CoRR, 2019

Deterministic constructions of compressed sensing matrices based on codes.
Cryptogr. Commun., 2019

New non-binary quantum codes from constacyclic codes over $ \mathbb{F}_q[u, v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $.
Adv. Math. Commun., 2019

Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes.
Appl. Math. Comput., 2019

A further construction of asymptotically optimal codebooks with multiplicative characters.
Appl. Algebra Eng. Commun. Comput., 2019

Quantum codes from cyclic codes over the ring 𝔽<sub>q</sub> + v<sub>1</sub>𝔽<sub>q</sub> + ⋯ + v<sub>r</sub> 𝔽<sub>q</sub>.
Appl. Algebra Eng. Commun. Comput., 2019

2018
Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2018

Constructions of balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity.
Theor. Comput. Sci., 2018

Constacyclic codes over the ring (𝔽<sub>q</sub>+v𝔽<sub>q</sub>+v<sup>2</sup>𝔽<sub>q</sub>) and their applications of constructing new non-binary quantum codes.
Quantum Inf. Process., 2018

A new class of zero-difference balanced functions.
Inf. Process. Lett., 2018

Deterministic Constructions of Compressed Sensing Matrices Based on Affine Singular Linear Space over Finite Fields.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Self-Dual Cyclic Codes over Z<sub>4</sub>[u]/<u<sup>2</sup>-1> and Their Applications of Z<sub>4</sub>-Self-Dual Codes Construction.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Two new classes of quantum MDS codes.
Finite Fields Their Appl., 2018

Deterministic construction of compressed sensing matrices with characters over finite fields.
Discret. Math. Algorithms Appl., 2018

Subspace code based on flats in affine space over finite fields.
Discret. Math. Algorithms Appl., 2018

Left dihedral codes over Galois rings GR(p2, m).
Discret. Math., 2018

Cyclotomic construction of strong external difference families in finite fields.
Des. Codes Cryptogr., 2018

An explicit representation and enumeration for negacyclic codes of length 2<sup>k</sup>n over Z<sub>4</sub>+uZ<sub>4</sub>.
CoRR, 2018

Local-Encoding-Preserving Secure Network Coding - Part II: Flexible Rate and Security Level.
CoRR, 2018

Local-Encoding-Preserving Secure Network Coding - Part I: Fixed Security Level.
CoRR, 2018

Optimal cyclic (r, δ) locally repairable codes with unbounded length.
CoRR, 2018

A class of repeated-root constacyclic codes over 𝔽<sub>p<sup>m</sup></sub>[u]/〈u<sup>e</sup>〉 of Type 2.
CoRR, 2018

Gray codes over certain run-length sequences for local rank modulation.
Sci. China Inf. Sci., 2018

ℤ<sub>2</sub>ℤ<sub>2</sub>ℤ<sub>4</sub>-additive cyclic codes.
Adv. Math. Commun., 2018

Constacyclic codes of length np<sup>s</sup> over 𝔽<sub>p<sup>m</sup></sub>+u𝔽<sub>p<sup>m</sup></sub>.
Adv. Math. Commun., 2018

Two classes of linear codes and their weight distributions.
Appl. Algebra Eng. Commun. Comput., 2018

Matrix-product structure of constacyclic codes over finite chain rings 𝔽<sub>p<sup>m</sup></sub>[u]/⟨u<sup>e</sup>⟩.
Appl. Algebra Eng. Commun. Comput., 2018

On Optimal (r, δ)-LRCs with Length n | (q+1).
Proceedings of the IEEE Information Theory Workshop, 2018

Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length.
Proceedings of the IEEE Information Theory Workshop, 2018

On Optimal Pseudo-cyclic ($r, \delta$) Locally Repairable Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Reconstruction Guarantee Analysis of Basis Pursuit for Binary Measurement Matrices in Compressed Sensing.
IEEE Trans. Inf. Theory, 2017

Deterministic Construction of Compressed Sensing Matrices from Codes.
Int. J. Found. Comput. Sci., 2017

On the Conjecture About the Linear Structures of Rotation Symmetric Boolean Functions.
Int. J. Found. Comput. Sci., 2017

Multi-receiver authentication scheme with hierarchical structure.
IET Inf. Secur., 2017

Two Classes of 1-Resilient Prime-Variable Rotation Symmetric Boolean Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

A Class of Optimal One-Coincidence Frequency-Hopping Sequence Sets with Composite Length.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

A q-polynomial approach to constacyclic codes.
Finite Fields Their Appl., 2017

2ℓ-Incorrigible set distributions of some linear codes by the finite geometry.
Discret. Math. Algorithms Appl., 2017

On the snake-in-the-box codes for rank modulation under Kendall's τ -metric.
Des. Codes Cryptogr., 2017

Complete weight enumerators of some irreducible cyclic codes.
Discret. Appl. Math., 2017

1-generator generalized quasi-cyclic codes over ℤ<sub>4</sub>.
Cryptogr. Commun., 2017

Secret sharing schemes for compartmented access structures.
Cryptogr. Commun., 2017

Complete weight enumerators of two classes of linear codes.
Cryptogr. Commun., 2017

A construction of several classes of two-weight and three-weight linear codes.
Appl. Algebra Eng. Commun. Comput., 2017

1-Generator quasi-cyclic and generalized quasi-cyclic codes over the ring ℤ<sub>4</sub>[u]/〈u<sup>2</sup>-1〉.
Appl. Algebra Eng. Commun. Comput., 2017

Some classes of linear codes over ℤ<sub>4</sub>+vℤ<sub>4</sub> and their applications to construct good and new ℤ<sub>4</sub>-linear codes.
Appl. Algebra Eng. Commun. Comput., 2017

On the weight hierarchy of locally repairable codes.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016
Variable-Rate Linear Network Error Correction MDS Codes.
IEEE Trans. Inf. Theory, 2016

On a Class of Left Metacyclic Codes.
IEEE Trans. Inf. Theory, 2016

Secret Sharing Schemes from Linear Codes overFp + vFp.
Int. J. Found. Comput. Sci., 2016

Multiple Repair Localities with Distinct Erasure Tolerance.
Int. J. Found. Comput. Sci., 2016

On left quaternion codes.
Int. J. Comput. Math., 2016

Some Results on Triple Cyclic Codes over Z<sub>4</sub>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Probabilistic Secret Sharing Schemes for Multipartite Access Structures.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

On the Nonlinearity and Affine Equivalence Classes of C-F Functions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Cooperative Local Repair with Multiple Erasure Tolerance.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

The Failure Probabilities of Random Linear Network Coding at Sink Nodes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

On double cyclic codes over Z<sub>4</sub>.
Finite Fields Their Appl., 2016

Concatenated structure of left dihedral codes.
Finite Fields Their Appl., 2016

Complete weight enumerators of some cyclic codes.
Des. Codes Cryptogr., 2016

Balanced 2p-variable rotation symmetric Boolean functions with optimal algebraic immunity.
Discret. Appl. Math., 2016

Constructions of Snake-in-the-Box Codes under ℓ<sub>∞</sub>-metric for Rank Modulation.
CoRR, 2016

A new trace bilinear form on cyclic $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes.
CoRR, 2016

Left dihedral codes over Galois rings GR(p<sup>2</sup>, m).
CoRR, 2016

Improved Results of Impossible Differential Cryptanalysis on Reduced FOX.
Comput. J., 2016

A Chinese remainder theorem approach to skew generalized quasi-cyclic codes over finite fields.
Cryptogr. Commun., 2016

Cyclic codes over F<sub>2<sup>m</sup></sub>[u] / ⟨u<sup>k</sup>⟩ of oddly even length.
Appl. Algebra Eng. Commun. Comput., 2016

2015
Unique Decoding of Certain Reed-Solomon Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

On the Locality and Availability of Linear Codes Based on Finite Geometry.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Multiple Impossible Differential Cryptanalysis on Reduced FOX.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Linear Codes and (1+<i>uv</i>)-Constacyclic Codes over <i>R</i>[<i>v</i>]/(<i>v</i><sup>2</sup>+<i>v</i>).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

On the Optimality of Secure Network Coding.
IEEE Commun. Lett., 2015

Small Field Size for Secure Network Coding.
IEEE Commun. Lett., 2015

Two self-dual codes with larger lengths over ℤ<sub>9</sub>.
Discret. Math. Algorithms Appl., 2015

Some results on cyclic codes over ℤq + uℤq.
Discret. Math. Algorithms Appl., 2015

Enumeration and construction of additive cyclic codes over Galois rings.
Discret. Math., 2015

Semisimple multivariable 𝔽<sub>q</sub>-linear codes over 𝔽<sub>q<sup>l</sup></sub>.
Des. Codes Cryptogr., 2015

On cyclic codes and quasi-cyclic codes over ℤ<sub>q</sub>+uℤ<sub>q</sub>.
CoRR, 2015

Constacyclic codes of length p<sup>s</sup>n over 𝔽<sub>p<sup>m</sup></sub>+u𝔽<sub>p<sup>m</sup></sub>.
CoRR, 2015

Cyclic codes over $\mathbb{F}_{2^m}[u]/\langle u^k\rangle$ of oddly even length.
CoRR, 2015

Variable-security-level secure network coding.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

The list decoding error probability of linear codes over the erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Two improved homomorphic MAC schemes in network coding.
Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015

2014
Stopping Sets of Algebraic Geometry Codes.
IEEE Trans. Inf. Theory, 2014

Some Results on Generalized Quasi-Cyclic Codes over 𝔽<sub>q</sub>+u𝔽<sub>q</sub>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

New sets of frequency-hopping sequences with optimal Hamming correlation.
Des. Codes Cryptogr., 2014

Distributed Storage Schemes over Unidirectional Ring Networks.
CoRR, 2014

Repairable Threshold Secret Sharing Schemes.
CoRR, 2014

Locality-preserving secure network coding.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Multi-receiver Authentication Scheme for Multiple Messages Based on Linear Codes.
Proceedings of the Information Security Practice and Experience, 2014

Distributed storage over unidirectional ring networks.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
Construction of Network Error Correction Codes in Packet Networks.
IEEE Trans. Inf. Theory, 2013

On The Average Partial Hamming Correlation of Frequency-Hopping Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

New results on two hypercube coloring problems.
Discret. Appl. Math., 2013

An Authentication Scheme for Subspace Codes over Network Based on Linear Codes
CoRR, 2013

Security Analysis on "An Authentication Code Against Pollution Attacks in Network Coding"
CoRR, 2013

The Failure Probability of Random Linear Network Coding for Networks
CoRR, 2013

Linear Network Error Correction Multicast/Broadcast/Dispersion Codes
CoRR, 2013

Linear Network Error Correction Multicast/Broadcast/Dispersion/Generic Codes.
CoRR, 2013

Quasi-Cyclic Codes Over Finite Chain Rings.
CoRR, 2013

Skew Generalized Quasi-Cyclic Codes over Finite Fields.
CoRR, 2013

Generalized Quasi-Cyclic Codes Over 𝔽<sub>q</sub>+u𝔽<sub>q</sub>.
CoRR, 2013

The existence and synchronization properties of symmetric fix-free codes.
Sci. China Inf. Sci., 2013

Incorrigible set distributions and unsuccessful decoding probability of linear codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
New Deep Holes of Generalized Reed-Solomon Codes
CoRR, 2012

Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves.
Proceedings of the Theory and Applications of Models of Computation, 2012

Constructions for Binary Codes Correcting Asymmetric Errors from Function Fields.
Proceedings of the Theory and Applications of Models of Computation, 2012

2011
Stopping Set Distributions of Some Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2011

The Average Failure Probabilities of Random Linear Network Coding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Linear recurring sequences and subfield subcodes.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

2010
The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence.
Theor. Comput. Sci., 2010

On homogeneous rotation symmetric bent functions.
Discret. Appl. Math., 2010

The Failure Probability at Sink Node of Random Linear Network Coding
CoRR, 2010

Stopping Set Distributions of Some Linear Codes
CoRR, 2010

On Random Linear Network Coding for Butterfly Network
CoRR, 2010

2009
The minimal polynomial over F<sub>q</sub> of linear recurring sequence over F<sub>q<sup>m</sup></sub>.
Finite Fields Their Appl., 2009

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences.
Finite Fields Their Appl., 2009

Johnson type bounds on constant dimension codes.
Des. Codes Cryptogr., 2009

The Minimal Polynomial over F_q of Linear Recurring Sequence over F_{q^m}
CoRR, 2009

Joint linear complexity of multisequences consisting of linear recurring sequences.
Cryptogr. Commun., 2009

2008
Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes.
IEEE Trans. Inf. Theory, 2008

On the minimum average distance of binary constant weight codes.
Discret. Math., 2008

Undetected error probability of <i>q</i> -ary constant weight codes.
Des. Codes Cryptogr., 2008

2007
On the counting function of the lattice profile of periodic sequences.
J. Complex., 2007

The characterization of binary constant weight codes meeting the bound of Fu and Shen.
Des. Codes Cryptogr., 2007

2006
A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes.
IEEE Trans. Inf. Theory, 2006

On the reliability-order-based decoding algorithms for binary linear block codes.
IEEE Trans. Inf. Theory, 2006

On the stopping distance of finite geometry LDPC codes.
IEEE Commun. Lett., 2006

On the minimum pseudo-codewords of LDPC codes.
IEEE Commun. Lett., 2006

Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes
CoRR, 2006

The Characterization of 2<sup><i>n</i></sup>-Periodic Binary Sequences with Fixed 1-Error Linear Complexity.
Proceedings of the Sequences and Their Applications, 2006

2005
The Probability of Undetected Error for Binary Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2005

The expectation and variance of the joint linear complexity of random periodic multisequences.
J. Complex., 2005

On the variance of average distance of subsets in the Hamming space.
Discret. Appl. Math., 2005

2004
On the capacity of write-unidirectional memories with nonperiodic codes.
IEEE Trans. Inf. Theory, 2004

Two constructions of permutation arrays.
IEEE Trans. Inf. Theory, 2004

On the constructions and nonlinearity of binary vector-output correlation-immune functions.
J. Complex., 2004

A generalization of MDS codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On constant-composition codes over Z<sub>q</sub>.
IEEE Trans. Inf. Theory, 2003

New lower bounds and constructions for binary codes correcting asymmetric errors.
IEEE Trans. Inf. Theory, 2003

On the undetected error probability for binary codes.
IEEE Trans. Inf. Theory, 2003

A new kind of geometric structures determining the chain good weight hierarchies.
Discret. Math., 2003

On Equidistant Constant Weight Codes.
Discret. Appl. Math., 2003

2002
On the rate-distortion region for multiple descriptions.
IEEE Trans. Inf. Theory, 2002

Constructions of permutation arrays.
IEEE Trans. Inf. Theory, 2002

elf-Complementary Balanced Codes and Quasi-Symmetric Designs.
Des. Codes Cryptogr., 2002

The complement of binary linear codes for error detection.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
On the Svanström bound for ternary constant-weight codes.
IEEE Trans. Inf. Theory, 2001

On the constructions of highly nonlinear zigzag functions and unbiased functions.
Inf. Process. Lett., 2001

On Equidistant Constant Weight Codes.
Electron. Notes Discret. Math., 2001

On the minimum average distance of binary codes: linear programming approach.
Discret. Appl. Math., 2001

2000
On the depth distribution of linear codes.
IEEE Trans. Inf. Theory, 2000

On the capacity and error-correcting codes of write-efficient memories.
IEEE Trans. Inf. Theory, 2000

The undetected error probability threshold of m-out-of-n codes.
IEEE Trans. Inf. Theory, 2000

1999
On the Capacity of Generalized Write-Once Memory with State Transitions Described by an Arbitrary Directed Acyclic Graph.
IEEE Trans. Inf. Theory, 1999

On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set.
IEEE Trans. Inf. Theory, 1999

On the constructions of new resilient functions from old ones.
IEEE Trans. Inf. Theory, 1999

1998
Binary Constant-Weight Codes for Error Detection.
IEEE Trans. Inf. Theory, 1998

On the Constructions of Constant-Weight Codes.
IEEE Trans. Inf. Theory, 1998

Hypothesis Testing for Arbitrarily Varying Source with Exponential-Type Constraint.
IEEE Trans. Inf. Theory, 1998

On the Average Hamming Distance for Binary Codes.
Discret. Appl. Math., 1998

1997
Nonperiodic Cyclic Equivalence Classes of Cyclic Codes and Algebraic Constructions of Cyclically Permutable Codes.
Proceedings of the Applied Algebra, 1997


  Loading...