Fang-Wei Fu
Orcid: 0000-0002-9696-8977Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
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
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
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
Discret. Math., January, 2024
Theor. Comput. Sci., 2024
Constructions of rotation symmetric Boolean functions satisfying almost all cryptographic criteria.
Theor. Comput. Sci., 2024
RAIRO Theor. Informatics Appl., 2024
Finite Fields Their Appl., 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
Proceedings of the IEEE International Symposium on Information Theory, 2024
2023
IEEE Trans. Inf. Theory, November, 2023
Finite Fields Their Appl., October, 2023
Discret. Math., September, 2023
Constructions of linear codes with two or three weights from vectorial dual-bent functions.
Discret. Math., August, 2023
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
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
IACR Cryptol. ePrint Arch., 2023
Des. Codes Cryptogr., 2023
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
Adv. Math. Commun., 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
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
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
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
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
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
Des. Codes Cryptogr., 2022
Bounds and Constructions of Singleton-Optimal Locally Repairable Codes with Small Localities.
CoRR, 2022
Post-quantum Multi-stage Secret Sharing Schemes using Inhomogeneous Linear Recursion and Ajtai's Function.
CoRR, 2022
CoRR, 2022
Cryptogr. Commun., 2022
Cryptogr. Commun., 2022
Cryptogr. Commun., 2022
Adv. Math. Commun., 2022
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
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the IEEE/CIC International Conference on Communications in China, 2022
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
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
Int. J. Found. Comput. Sci., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Des. Codes Cryptogr., 2021
Polynomial-Time Key Recovery Attack on the Lau-Tan Cryptosystem Based on Gabidulin Codes.
CoRR, 2021
CoRR, 2021
CoRR, 2021
CoRR, 2021
The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks.
CoRR, 2021
CoRR, 2021
Cryptogr. Commun., 2021
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
Proceedings of the IEEE International Symposium on Information Theory, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
IEEE Trans. Inf. Theory, 2020
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
Int. J. Found. Comput. Sci., 2020
New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem.
IET Inf. Secur., 2020
IEEE Commun. Lett., 2020
New (k, l, m)-verifiable multi-secret sharing schemes based on XTR public key system.
IACR Cryptol. ePrint Arch., 2020
Finite Fields Their Appl., 2020
Construction and enumeration for self-dual cyclic codes of even length over F2m+uF2m.
Finite Fields Their Appl., 2020
Discret. Math., 2020
Discret. Math., 2020
Des. Codes Cryptogr., 2020
Deterministic construction of compressed sensing matrices from constant dimension codes.
Discret. Appl. Math., 2020
Cryptogr. Commun., 2020
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
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
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
Inf. Process. Lett., 2019
Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2.
Int. J. Found. Comput. Sci., 2019
Int. J. Found. Comput. Sci., 2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
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
Finite Fields Their Appl., 2019
The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length.
Discret. Math., 2019
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
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
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
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
Deterministic construction of compressed sensing matrices with characters over finite fields.
Discret. Math. Algorithms Appl., 2018
Discret. Math. Algorithms Appl., 2018
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
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
Sci. China Inf. Sci., 2018
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
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
Proceedings of the IEEE Information Theory Workshop, 2018
Proceedings of the IEEE Information Theory Workshop, 2018
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
Int. J. Found. Comput. Sci., 2017
On the Conjecture About the Linear Structures of Rotation Symmetric Boolean Functions.
Int. J. Found. Comput. Sci., 2017
IET Inf. Secur., 2017
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
Discret. Math. Algorithms Appl., 2017
Des. Codes Cryptogr., 2017
Discret. Appl. Math., 2017
Cryptogr. Commun., 2017
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
Proceedings of the 2017 IEEE Information Theory Workshop, 2017
2016
IEEE Trans. Inf. Theory, 2016
Int. J. Found. Comput. Sci., 2016
Int. J. Found. Comput. Sci., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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
CoRR, 2016
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
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
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
Discret. Math. Algorithms Appl., 2015
Discret. Math., 2015
Des. Codes Cryptogr., 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
CoRR, 2015
Proceedings of the 2015 IEEE Information Theory Workshop, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
Proceedings of the 12th International Conference on Fuzzy Systems and Knowledge Discovery, 2015
2014
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
Des. Codes Cryptogr., 2014
Proceedings of the 2014 IEEE Information Theory Workshop, 2014
Proceedings of the Information Security Practice and Experience, 2014
Proceedings of the International Symposium on Information Theory and its Applications, 2014
2013
IEEE Trans. Inf. Theory, 2013
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
CoRR, 2013
Security Analysis on "An Authentication Code Against Pollution Attacks in Network Coding"
CoRR, 2013
CoRR, 2013
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
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
2011
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
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
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
Cryptogr. Commun., 2009
2008
IEEE Trans. Inf. Theory, 2008
Discret. Math., 2008
Des. Codes Cryptogr., 2008
2007
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
IEEE Trans. Inf. Theory, 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
IEEE Trans. Inf. Theory, 2005
The expectation and variance of the joint linear complexity of random periodic multisequences.
J. Complex., 2005
Discret. Appl. Math., 2005
2004
IEEE Trans. Inf. Theory, 2004
On the constructions and nonlinearity of binary vector-output correlation-immune functions.
J. Complex., 2004
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
2003
IEEE Trans. Inf. Theory, 2003
Discret. Math., 2003
2002
IEEE Trans. Inf. Theory, 2002
elf-Complementary Balanced Codes and Quasi-Symmetric Designs.
Des. Codes Cryptogr., 2002
Proceedings of the 2002 IEEE Information Theory Workshop, 2002
2001
IEEE Trans. Inf. Theory, 2001
Inf. Process. Lett., 2001
Discret. Appl. Math., 2001
2000
IEEE Trans. Inf. Theory, 2000
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
IEEE Trans. Inf. Theory, 1999
IEEE Trans. Inf. Theory, 1999
1998
IEEE Trans. Inf. Theory, 1998
1997
Nonperiodic Cyclic Equivalence Classes of Cyclic Codes and Algebraic Constructions of Cyclically Permutable Codes.
Proceedings of the Applied Algebra, 1997