- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2019 International Conference on Microwave and Millimeter Wave Technology (ICMMT) - Guangzhou, China (2019.5.19-2019.5.22)] 2019 International Conference on Microwave and Millimeter Wave Technology (ICMMT) - Dynamically Substrate Integrated Waveguide Programmable Metasurface for SAR imaging
摘要： 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 paper, we reveal that a linear solution over a given finite field does not necessarily imply the existence of a linear solution over all larger finite fields. In particular, we prove by construction that: 1) for every ω ≥ 3, there is a multicast network with source outdegree ω linearly solvable over GF(7) but not over GF(8), and another multicast network linearly solvable over GF(16) but not over GF(17); 2) there is a multicast network linearly solvable over GF(5) but not over such GF(q) that q > 5 is a Mersenne prime plus 1, which can be extremely large; 3) a multicast network linearly solvable over GF(q m1 ) and over GF(q m2 ) is not necessarily linearly solvable over GF(q m1+m2 ); and 4) there exists a class of multicast networks with a set T of receivers such that the minimum field size qmin for a linear solution over GF(qmin) is lower bounded by (cid:3)( |T |), but not every larger field than GF(qmin) suffices to yield a linear solution. The insight brought from this paper is that not only the field size but also the order of subgroups in the multiplicative group of a finite field affects the linear solvability of a multicast network.
关键词： multicast network,field size,lower bound,Linear network coding,Mersenne prime
更新于2025-09-16 10:30:52
-
[IEEE 2019 IEEE 8th International Conference on Advanced Optoelectronics and Lasers (CAOL) - Sozopol, Bulgaria (2019.9.6-2019.9.8)] 2019 IEEE 8th International Conference on Advanced Optoelectronics and Lasers (CAOL) - A pulsed diode laser for tectonic aerosol lidar sensing
摘要： 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 paper, we reveal that a linear solution over a given finite field does not necessarily imply the existence of a linear solution over all larger finite fields. In particular, we prove by construction that: 1) for every ω ≥ 3, there is a multicast network with source outdegree ω linearly solvable over GF(7) but not over GF(8), and another multicast network linearly solvable over GF(16) but not over GF(17); 2) there is a multicast network linearly solvable over GF(5) but not over such GF(q) that q > 5 is a Mersenne prime plus 1, which can be extremely large; 3) a multicast network linearly solvable over GF(q m1 ) and over GF(q m2 ) is not necessarily linearly solvable over GF(q m1+m2 ); and 4) there exists a class of multicast networks with a set T of receivers such that the minimum field size qmin for a linear solution over GF(qmin) is lower bounded by (cid:3)( |T |), but not every larger field than GF(qmin) suffices to yield a linear solution. The insight brought from this paper is that not only the field size but also the order of subgroups in the multiplicative group of a finite field affects the linear solvability of a multicast network.
关键词： multicast network,field size,lower bound,Linear network coding,Mersenne prime
更新于2025-09-16 10:30:52
-
[IEEE 2019 Compound Semiconductor Week (CSW) - Nara, Japan (2019.5.19-2019.5.23)] 2019 Compound Semiconductor Week (CSW) - High efficiency 100-nm-sized InGaN/GaN active region fabricated by neutral-beam-etching and GaN regrowth for directional micro-LED
摘要： 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 paper, we reveal that a linear solution over a given finite field does not necessarily imply the existence of a linear solution over all larger finite fields. In particular, we prove by construction that: 1) for every ω ≥ 3, there is a multicast network with source outdegree ω linearly solvable over GF(7) but not over GF(8), and another multicast network linearly solvable over GF(16) but not over GF(17); 2) there is a multicast network linearly solvable over GF(5) but not over such GF(q) that q > 5 is a Mersenne prime plus 1, which can be extremely large; 3) a multicast network linearly solvable over GF(q m1 ) and over GF(q m2 ) is not necessarily linearly solvable over GF(q m1+m2 ); and 4) there exists a class of multicast networks with a set T of receivers such that the minimum field size qmin for a linear solution over GF(qmin) is lower bounded by (cid:3)( |T |), but not every larger field than GF(qmin) suffices to yield a linear solution. The insight brought from this paper is that not only the field size but also the order of subgroups in the multiplicative group of a finite field affects the linear solvability of a multicast network.
关键词： field size,Linear network coding,multicast network,lower bound,Mersenne prime
更新于2025-09-16 10:30:52
-
A Priority-Based Multiobjective Design for Routing, Spectrum, and Network Coding Assignment Problem in Network-Coding-Enabled Elastic Optical Networks
摘要： In elastic optical networks, the use of network coding (NC) represents a new dimension to further optimize spectrum efficiency, and indeed, combining NC and dedicated path protection has paved the way for achieving greater capacity efficiency, while retaining the merit of near-instantaneous recovery. In order to harness the NC benefits, a more complicated problem called routing, spectrum, and network coding assignment (RSNCA) has to be solved, and in this article, we propose a priority-based multiobjective design for the RSNCA problem aiming at maximizing the network throughput in the constrained bandwidth capacity and simultaneously minimizing the spectrum link usage for accepted demands. The multiobjective design is based on the weighting method, and we present a rigorous analysis on the impact of weight coefficients to the priority of constituent objectives. The efficacy of our design proposal is benchmarked with reference ones based on the traditional single-objective model and for both coding and non-coding approaches on various realistic topologies. It is highlighted that the application of NC brings about considerable throughput enhancement, and furthermore, the multiobjective RSNCA design is highly more efficient than the single-objective RSNCA, as up to more than 50% saving on spectrum link usage could be attained.
关键词： routing and spectrum assignment (RSA),elastic optical networks,network coding (NC),intelligent optical networks,integer linear programming,multiobjective optimization,Dedicated protection
更新于2025-09-16 10:30:52
-
[IEEE 2018 International Conference on Computational Science and Computational Intelligence (CSCI) - Las Vegas, NV, USA (2018.12.12-2018.12.14)] 2018 International Conference on Computational Science and Computational Intelligence (CSCI) - Combining LIDAR, Passive Infrared, and Markov Chain Prediction for Flexible, Portable Occupancy Monitoring
摘要： Asynchronous network coding has the potential to improve wireless network performance compared with simple routing. However, to achieve the maximum network coding gain, the encoding node consumes a few computing and storage resources that may be unaffordable for wireless sensor networks such as CubeSats. An analogous threshold strategy, called best effort network coding (BENC), which requires only minimal storage resources and no computing resources, is investigated in this paper as an efficient and convenient method of network coding. In this strategy, a new packet arrival evicts the head packet when the queue is full to avoid excessively long waits. Moreover, in contrast to other methods that require a queue for each flow, the BENC uses only one queue for the two coded flows. In addition, the problem of time interval distribution for the output flow, which combines two independent flows, is investigated, and the network coding gain is then analyzed. While the maximum coding gain requires infinite buffer capacity under two independent Poisson arrivals with the same transmission rates, the calculation results show that the BENC needs only 4 buffers to achieve 90% of the maximum coding gain and can reach 99% of the maximum coding gain using 50 buffers. These results are verified by numerical simulations.
关键词： wireless sensor networks,queue capacity,best effort,queueing analysis,Network coding
更新于2025-09-16 10:30:52
-
Secure quantum network coding based on quantum homomorphic message authentication
摘要： As the principal security threat, pollution attacks also seriously affect the security of quantum network coding, just like they do for the classical network coding. Based on this, we ?rst propose two secure quantum homomorphic message authentication schemes based on quantum circuit, which well resist the pollution attacks launched by outside attackers and the attackers including inside untrusted nodes over the general quantum network. Then, we apply this authentication method into our extended quantum network coding scheme over the multi-unicast network N , solving the quantum k-pair problem securely and perfectly. Analysis results show that our proposed quantum network coding scheme has higher security and higher quantum communication rate, compared with the existing secure scheme.
关键词： Quantum k-pair problem,Secure quantum network coding,Pollution attacks,Quantum homomorphic message authentication
更新于2025-09-09 09:28:46
-
Efficient quantum state transmission via perfect quantum network coding
摘要： Quantum network coding with the assistance of auxiliary resources can achieve perfect transmission of the quantum state. This paper suggests a novel perfect network coding scheme to efficiently solve the quantum k-pair problem, in which only a few assisting resources are introduced. Specifically, only one pair of maximally entangled state needs to be pre-shared between two intermediate nodes, and only O(k) of classical information is transmitted though the network. Moreover, the classical communication used in our protocol does not cause transmission congestion, providing better adaptability to large-scale quantum k-pair networks. Through relevant analyses and comparisons, we demonstrate that our proposed scheme saves resources and has good application value, thereby showing its high efficiency. Furthermore, the proposed scheme achieves 1-max flow quantum communication, and the achievable rate region result is extended from its counterpart over the butterfly network.
关键词： achievable rate region,perfect quantum network coding,efficient quantum state transmission,communication efficiency,quantum k-pair problem
更新于2025-09-04 15:30:14