Qifu Tyler Sun

Qifu Tyler Sun
University of Science and Technology Beijing | USTB · School of computer and communication engineering

PhD

About

47
Publications
4,347
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
481
Citations
Additional affiliations
June 2019 - present
University of Science and Technology Beijing
Position
  • Professor (Full)
November 2013 - June 2019
University of Science and Technology Beijing
Position
  • Professor (Associate)
August 2009 - December 2013
The Chinese University of Hong Kong
Position
  • Postdoctoral Fellow/Research Associate
Education
August 2005 - July 2009
The Chinese University of Hong Kong
Field of study
  • Information Engineering
September 2001 - May 2005
The Chinese University of Hong Kong
Field of study
  • Information Engineering

Publications

Publications (47)
Article
Full-text available
Network coding is a new paradigm in data transport that combines coding with data propagation over a network. Theory of linear network coding (LNC) adopts a linear coding scheme at every node of the network and promises the optimal data transmission rate from the source to all receivers. Linearity enhances the theoretic elegance and engineering sim...
Article
The fundamental result of linear network coding asserts the existence of an optimal code on an acyclic single-source multicast network when the symbol field is sufficiently large. The restriction to acyclic networks turns out to stem from the customary structure of the symbol alphabet as a field. Adopting data units belonging to a discrete valuatio...
Article
Full-text available
Inspired by engineering of high-speed switching with quality of service, this paper introduces a new approach to classify finite lattices by the concept of cut-through coding. An n-ary cut-through code of a finite lattice encodes all lattice elements by distinct n-ary strings of a uniform length such that for all j, the initial j encoding symbols o...
Article
In this paper, we investigate lattice network codes (LNCs) constructed from Eisenstein integer based lattices. Quantization and encoding algorithms over Eisenstein integers are first introduced. Then, a union bound estimation (UBE) of the decoding error probability is derived when the shaping region of the LNC is a product of regular hexagons. Next...
Conference Paper
Full-text available
This paper deals with matroids on the edge set of a network. Through the structure of edge-disjoint paths, a single-source network is associated with a network matroid, which turns out to be representable. A linear network code on an acyclic network assigns a coding vector to every edge. The linear independence among coding vectors naturally induce...
Preprint
Full-text available
As the next-generation wireless networks thrive, full-duplex and relaying techniques are combined to improve the network performance. Random linear network coding (RLNC) is another popular technique to enhance the efficiency and reliability in wireless communications. In this paper, in order to explore the potential of RLNC in full-duplex relay net...
Article
Memory maximum-distance-separable (mMDS) sliding window codes are a type of erasure codes with high erasure-correction capability and low decoding delay. In this paper, we study two types of systematic mMDS sliding window codes over erasure channels, i.e., scalar codes defined over a finite field $GF(2^{L})$ , and vector codes defined over a ve...
Article
In wireless broadcast, random linear network coding (RLNC) over GF(2L) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xl...
Article
Circular-shift linear network coding (LNC) is a class of LNC schemes with low coding complexities. However, there are explicit multicast networks whose capacities cannot be achieved by circular-shift LNC. In this work, we first extend the formulation of circular-shift LNC from over GF(2) to over GF( $p$ ), where $p$ is an arbitrary prime. Then,...
Preprint
In wireless broadcast, random linear network coding (RLNC) over GF($2^L$) is known to asymptotically achieve the optimal completion delay with increasing $L$. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF($2^L$). In this paper, a comprehensive analysis of completion delay and decoding comple...
Article
In a multicast network, a circular-shift linear code can be induced from a scalar linear code such that equipped with a nontrivially constructed source encoding matrix, the induced code qualifies to be a circular-shift linear solution at a certain rate. However, for such an induced solution, there was no explicit characterization of the correspondi...
Article
Circular-shift linear network coding (LNC) is a class of vector LNC with low encoding and decoding complexities, and with local encoding kernels chosen from cyclic permutation matrices. When L is a prime with primitive root 2, it was recently shown that a scalar linear solution over GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xli...
Preprint
Full-text available
Circular-shift linear network coding (LNC) is a special type of vector LNC with low encoding and decoding complexities, with local encoding kernels chosen from cyclic permutation matrices. When $L$ is a prime with primitive root $2$, it was recently shown that a scalar linear solution over GF($2^{L-1}$) can induce an $L$-dimensional circular-shift...
Article
Full-text available
Unlike prior efforts in cybersecurity research, a dynamic defense theory, called moving target defense (MTD), increases the complexity and costs for attacks by effectively restricting the vulnerability exposure and the attack opportunities through various continually-changing evaluation, development mechanisms and strategy. Data Encryption Standard...
Article
We design classes of quantum low-density paritycheck (LDPC) codes, called quasi-cyclic stabilizer (QCS) codes, from conventional QC-LDPC codes. The proposed QCS codes belong to the family of non-Calderbank-Shor-Steane stabilizer codes. The QC-LDPC codes are self-orthogonal with respect to the symplectic inner product (SIP) and are constructed from...
Article
Full-text available
On a (single-source) multicast network with possible edge failures, variable-rate and static linear network coding (LNC) is a special class of scalar LNC schemes under which the source can generate a message of an arbitrary rate so that every eligible receiver can recover the message. In the present paper, we formulate the variable-rate and static...
Article
Full-text available
We study a class of linear network coding (LNC) schemes, called \emph{circular-shift} LNC, whose encoding operations at intermediate nodes consist of only circular-shifts and bit-wise addition (XOR). Departing from existing literature, we systematically formulate circular-shift LNC as a special type of vector LNC, where the local encoding kernels o...
Article
Full-text available
Mobile Ad Hoc Networks (MANETs) are composed of a large number of devices that act as dynamic nodes with limited processing capabilities that can share data among each other. Energy efficient security is the major issue in MANETs where data encryption and decryption operations should be optimized to consume less energy. In this regard, we have focu...
Article
This paper studies an uplink distributed MIMO (DMIMO) system that consists of K users and K0 distributed base stations (BSs), where the BSs are connected to a central unit (CU) via independent rate-constrained backhaul (BH) links. We propose a new signal-space aligned network coding scheme. First, a network coding generator matrix is selected subje...
Article
Full-text available
For a (single-source) multicast network, the size of a base field is the most known and studied algebraic identity that is involved in characterizing its linear solvability over the base field. In this paper, we design a new class $\mathcal{N}$ of multicast networks and obtain an explicit formula for the linear solvability of these networks, which...
Article
Full-text available
Vector linear network coding (LNC) is a generalization of the conventional scalar LNC, such that the data unit transmitted on every edge is an $L$-dimensional vector of data symbols over a base field GF($q$). Vector LNC enriches the choices of coding operations at intermediate nodes, and there is a popular conjecture on the benefit of vector LNC ov...
Conference Paper
Lattice network coding is an important building block of physical-layer network coding. The receiver is required to compute a linear combination of the source symbols belonging to a finite alphabet with an algebraic structure. In this paper, lattice network codes are constructed from lattices that have optimal packing density and the best known sha...
Conference Paper
A few (single-source) multicast networks were recently discovered with the special property of linearly solvable over a finite field GF(q) but not over a larger GF(q′). In this paper, these networks are extended to a general class N of multicast networks. We obtain a concise condition, in terms of multiplicative subgroup orders in GF(q), for networ...
Article
A distributed multiple-input-multiple-output (MIMO) system consists of M users served by L distributed base stations (BSs), where the BSs are connected to a central unit (CU) via L independent backhaul (BH) links. In this paper, we consider the design of an uplink distributed MIMO system where 1) the channel state information is not available at th...
Article
Full-text available
The conventional theory of linear network coding (LNC) is only over acyclic networks. Convolutional network coding (CNC) applies to all networks. It is also a form of LNC, but the linearity is w.r.t. the ring of rational power series rather than the field of data symbols. CNC has been generalized to LNC w.r.t. any discrete valuation ring (DVR) in o...
Article
Full-text available
We propose two types, namely Type-I and Type-II, quantum stabilizer codes using quadratic residue sets of prime modulus given by the form $p=4n\pm1$. The proposed Type-I stabilizer codes are of cyclic structure and code length $N=p$. They are constructed based on multi-weight circulant matrix generated from idempotent polynomial, which is obtained...
Article
Full-text available
In an acyclic multicast network, it is well known that a linear network coding solution over GF($q$) exists when $q$ is sufficiently large. In particular, for each prime power $q$ no smaller than the number of receivers, a linear solution over GF($q$) can be efficiently constructed. In this work, we reveal that a linear solution over a given finite...
Article
This letter studies lattice-partition-based physical layer network coding (LNC) over the finite field GF(4), whose quaternary constellation has practical interests. The optimal dither method in terms of energy efficiency is first derived for LNC over GF(4), and it is shown to save 1/3 average transmission power. Next, LNC design from linear codes o...
Article
For a linear network code (LNC), various senses of optimality are defined by linear independence among certain coding vectors. A generic LNC is optimal in an extreme sense. Over an acyclic network, there has been a characterization of a generic LNC by the coincidence between the matroid of linearly independent sets of coding vectors of the LNC and...
Conference Paper
A combinatorial notion of flow is identified for timeinvariant linear coding over non-layered deterministic linear networks that may contain cycles, broadcast and interference links. It reveals the matroidal structure for efficient code construction, and enables a seamless extension of the classical network coding results. In particular, the flow c...
Conference Paper
In this paper, we propose a novel opportunistic pair-wise transmission scheme in a multi-way relay channel (MWRC), in which multiple users exchange information via a common relay. We investigate pair-wise compute-and-forward for MWRCs by exploiting the multi-user fading channels. Conventionally, a pair-wise physical-layer network coding scheme with...
Article
In this paper, a time-variant decoding model of a convolutional network code (CNC) is proposed. New necessary and sufficient conditions are established for the decodability of a CNC at a node r with delay L. They only involve the first L+1 terms in the power series expansion of the global encoding kernel matrix at r. Concomitantly, a time-variant d...
Conference Paper
In this paper, we investigate lattice network codes (LNCs) constructed from lattices over the ring of Eisenstein integers. Quantization and encoding algorithms over Eisenstein integers are first introduced. Then, a union bound estimation (UBE) of the decoding error probability is derived when the shaping region of the LNC is a product of regular he...
Conference Paper
On an acyclic network, generic linear network codes are known to have the strongest optimality in terms of linear independence. This paper characterizes other properties of generic codes on a given acyclic network. We first show that every generic code is variable-rate generic with the additional property that the coding coefficients in relation to...
Article
Full-text available
In this paper, convolutional network coding is formulated by means of matrix power series representation of the local encoding kernel (LEK) matrices and global encoding kernel (GEK) matrices to establish its theoretical fundamentals for practical implementations. From the encoding perspective, the GEKs of a convolutional network code (CNC) are show...
Article
Unequal error/erasure protection (UEP) is often employed in multilayer video streaming to ensure successful reception of the important reference layers. In this paper, we investigate possible ways to provide such protection to the multicasting sessions of scalable video codes (SVC) using ran- domized linear network codes (RLNCs). We surmised that i...
Conference Paper
Full-text available
In this work, we define delay invariant convolutional network codes which guarantee multicast communication at asymptotically optimal rates in networks with arbitrary delay patterns. We show the existence of such a code over every symbol field. Moreover, the code can be constructed with high probability when coding coefficients are independently an...

Network

Cited By