检索结果-内蒙古大学图书馆

12th International Symposium on Wireless Communication Systems (ISWCS)

作者： Vazquez-Castro, M. A. Univ Autonoma Barcelona Dept Telecommun & Syst Engn E-08193 Barcelona Spain

ISBN: (纸本)9781467365406

The motivation of this paper is to analyze the applicability of subspace coding for improving the reliability of the erasure satellite channel. Towards this aim, erasure satellite channel scenarios are analysed first in order to identify whether or not they can be modeled as F-q-linear erasure satellite channels. Conditions are found under which the relevant case of multicast over satellite can be modelled as F-q-linear transmission. For such cases, a novel subspace coding scheme is proposed that reveals the analytical convenience of F-q-linear channel modelling while enabling the use of linear algebra for efficient encoding, re-encoding and decoding.

关键词： subspace coding satellite communications broadcast channel

来源：评论

学校读者我要写书评

暂无评论

3D Human Action Recognition Using a Single Depth Feature and Locality-Constrained Affine subspace coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2018年第10期28卷 2920-2932页

作者： Liang, Chengwu Qi, Lin He, Yifeng Guan, Ling Zhengzhou Univ Sch Informat Engn Zhengzhou 450001 Henan Peoples R China Henan Univ Urban Construct Sch Elect Engn Pingdingshan 467036 Peoples R China Ryerson Univ Dept Elect & Comp Engn Toronto ON M5B 2K3 Canada

This paper addresses the problem of recognizing human actions from depth videos. We propose a depth-based local descriptor and affine subspace coding representation with locality-constrained affine subspace coding (LASC) for 3D action recognition. First, each depth video sequence is divided into a set of subsequences (i.e., multi-scale sub-actions) based on the normalized motion enemy vector. Next, depth motion map-based gradient local auto-correlation features are employed to capture the shape information and motion cues of each sub-action. In order to obtain discriminative and compact representation, we extract the local high-order information of the depth video using LASC. Through experiments, we show that the use of LASC exhibits better performance compared with existing methods such as locality-constrained linear coding. We compared LASC with the state-of-the-art methods based on similar principle, using features extracted from a single modality, on four datasets, and with those using multiple features or nonlinear recognition machines. The results on four datasets clearly show the effectiveness of the proposed method.

关键词： Action recognition subspace coding dictionary learning depth motion map depth feature GLAC LLC

来源：评论

学校读者我要写书评

暂无评论

Function computation via subspace coding

引用

PHYSICAL COMMUNICATION 2013年 6卷 134-141页

作者： Karamchandani, Nikhil Keller, Lorenzo Fragouli, Christina Franceschetti, Massimo Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Univ Calif San Diego La Jolla CA 92093 USA Univ Calif Los Angeles Los Angeles CA 90095 USA

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for computing functions, that requires intermediate nodes to be aware of the function to be computed, our designs are transparent to the intermediate node operations. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Function computation Network coding subspace coding Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

On the Minimum subspace coding Capacity of Multiplicative Finite-Field Matrix Channels with a Given Rank Distribution 22

On the Minimum Subspace Coding Capacity of Multiplicative Fi...

引用

22nd Asia-Pacific Conference on Communications (APCC)

作者： Liu, Chenchen Li, Xiaolin Zhou, Baojian Mow, Wai Ho Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781509006762

In the scenario of random linear network coding, the channel input and output are matrices over a finite field related by a multiplicative channel matrix. Such channels are called the multiplicative finite-field matrix channels ( MFFMC). To communicate over such channels, subspace coding is a promising non-coherent network coding approach which does not require the estimation of the channel matrix. The capacity of subspace coding over the general MFFMC is still unknown ( except for some special cases, such as the purely random channel and the uniform full rank channel). In this paper, for a given rank distribution, a class of worst-case channels is characterized and proved to achieve the minimum capacity of subspace coding. Hence the capacity of such a class of channels can serve as the tightest lower bound on the capacity of subspace coding over the MFFMC. Interestingly, for the purely random channel, the uniform full rank channel and the uniform given rank channel, our bound gives the exact value of the capacity of subspace coding. Numerical results show that our bound is tighter than some existing bound at small-to-moderate packet lengths.

关键词： multiplicative matrix channel subspace coding channel capacity non-coherent network coding

来源：评论

学校读者我要写书评

暂无评论

Rank Deficient Decoding for Arithmetic subspace Network coding 1

Rank Deficient Decoding for Arithmetic Subspace Network Codi...

引用

International Conference for Students on Applied Engineering (ICSAE)

作者： Karimian, Pourya Ardakani, Masoud Univ Alberta Elect & Comp Engn Dept Edmonton AB T6G 2M7 Canada

ISBN: (纸本)9781467390538

In arithmetic network coding (ANC), finite field operations are replaced by real or complex arithmetic operations. This has applications in physical layer network coding or in multi-resolution multicast, where users with a higher download capacity experience a better quality of service. A major problem in random ANC is that the condition number of the network grows quickly with the network size, hence, noise can cause many errors in larger networks. An efficient solution for error correction in network coding is subspace coding. However, existing subspace coding solutions are based on finite field operations and cannot be used with ANC. Some of the difficulties of applying subspace coding to ANC are: (i) there are infinite subspaces to choose from;(ii) the effect of noise is on all links, where the noise strength increases hop by hop;and (iii) the decoding algorithms of ANC and subspace decoding are very different. In this work, we develop a subspace arithmetic network coding framework. We first model the network noise from which we then develop a decoding algorithm. Our simulation results show the success of our proposed method over conventional ANC.

关键词： Random linear network coding arithmetic network coding rank deficient decoding subspace coding

来源：评论

学校读者我要写书评

暂无评论

subspace Properties of Network coding and Their Applications

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第5期58卷 2599-2619页

作者： Siavoshani, Mahdi Jafari Fragouli, Christina Diggavi, Suhas N. Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process, the network nodes collect random subspaces of the space spanned by the source packets. We establish several fundamental properties of the random subspaces induced in such a system and show that these subspaces implicitly carry topological information about the network and its state that can be passively collected and inferred. We leverage this information toward a number of applications that are interesting in their own right, such as topology inference, bottleneck discovery in peer-to-peer systems, and locating Byzantine attackers. We thus argue that randomized network coding, apart from its better known properties for improving information delivery rate, can additionally facilitate network management and control.

关键词： Byzantine attack network coding random subspaces randomized network coding subspace coding topology inference topology management

来源：评论

学校读者我要写书评

暂无评论

Parallel construction for constant dimension codes from mixed dimension construction

引用

DESIGNS CODES AND CRYPTOGRAPHY 2025年第1期93卷 227-241页

作者： He, Xianmang Zhang, Zusheng Tian, Si Wang, Jingli Chen, Yindong Ningbo Univ Finance & Econ Coll Digital Technol & Engn Ningbo 315175 Peoples R China South China Agr Univ Coll Math & Informat Coll Software Engn Guangzhou 510642 Peoples R China Shantou Univ Dept Comp Sci & Technol Shantou 515063 Peoples R China Shantou Univ Key Lab Intelligent Mfg Technol Minist Educ Shantou 515063 Peoples R China

The community has been pursuing improvements in the cardinalities for constant dimensional codes (CDC for short) for the past decade. Lao et al. (IEEE Trans Inf Theory 69(7):4333-4344, 2023) has shown that mixed dimension subspace codes can be used to construct large constant dimension subspace codes. The exploration of the CDCs' construction is transformed into finding mixed dimension/distance subspace codes with large dimension distributions. In this paper, we apply the parallel construction to this mixed dimension construction, which allows us to contribute approximately more than 80 new constant dimension codes.

关键词： subspace coding Constant dimension codes Mixed dimension construction Maximum rank-distance (MRD) code

来源：评论

学校读者我要写书评

暂无评论

Capacity Analysis of Linear Operator Channels Over Finite Fields

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第8期60卷 4880-4901页

作者： Yang, Shenghao Ho, Siu-Wai Meng, Jin Yang, En-Hui Tsinghua Univ Inst Interdisciplinary Informat Sci Inst Theoret Comp Sci Beijing 100084 Peoples R China Univ S Australia Inst Telecommun Res Adelaide SA 5000 Australia Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over finite fields are studied. Both the Shannon capacity C and the subspace coding capacity C-SS are analyzed. By establishing and comparing lower bounds on C and upper bounds on C-SS, various necessary conditions and sufficient conditions such that C = C-SS are obtained. A new class of LOCs such that C = C-SS is identified, which includes LOCs with uniform-given-rank transfer matrices as special cases. It is also demonstrated that C-SS is strictly less than C for a broad class of LOCs. In general, an optimal subspace coding scheme is difficult to find because it requires to solve the maximization of a nonconcave function. However, for an LOC with a unique subspace degradation, C-SS can be obtained by solving a convex optimization problem over rank distribution. Classes of LOCs with a unique subspace degradation are characterized. Since LOCs with uniform-given-rank transfer matrices have unique subspace degradations, some existing results on LOCs with uniform-given-rank transfer matrices are explained from a more general way.

关键词： Linear operator channel network coding subspace coding

来源：评论

学校读者我要写书评

暂无评论

Improved generalized block inserting construction of constant dimension codes

引用

DESIGNS CODES AND CRYPTOGRAPHY 2023年第2期91卷 475-495页

作者： Hong, Xiaoqin Cao, Xiwang Nanjing Univ Aeronaut & Astronaut Coll Math Nanjing 211106 Peoples R China MIIT Key Lab Math Modelling & High Performance Comp Ai Nanjing 211106 Peoples R China

Constant dimension codes (CDCs) have received extensive attention due to their applications in random network coding. The basic problem for CDCs is to determine the maximal possible cardinality A(q) (n, d, k) of CDC for given parameters q, n, d and k. In this paper, we present some variations on the generalized block inserting construction method. These constructions insert more subspaces into the CDC from the parallel linkage construction via changing the parameters and shifting the positions of some small matrices. Our constructions help us to obtain CDCs with larger cardinalities and some new lower bounds for CDCs which are better than the previously best known ones.

关键词： subspace coding Constant dimension codes Inserting construction Rank metric codes

来源：评论

学校读者我要写书评

暂无评论

A weighted least squares approach to precoding with pilots for MIMO-OFDM

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2006年第10期54卷 4067-4073页

作者： Pande, Tarkesh Love, David J. Krogmeier, James V. Purdue Univ Sch Elect & Comp Engn Ctr Wireless Syst & Applicat W Lafayette IN 47907 USA

Next-generation wireless systems are expected to leverage multiple-antenna, commonly called multiple-input multiple-output (MIMO), technology transmitting over broadband channels via orthogonal frequency-division multiplexing (OFDM). It is now well known that MIMO systems can obtain error rate and capacity improvements by adapting the transmitter to the current channel conditions. Linear spatial precoding is a popular technique for channel adaptation where the transmitted space-time signal for each subcarrier is multiplied by a precoding matrix before transmission. Spatial precoding is complicated, however, in OFDM because channel information is often only known for a small number of pilot tones. In this correspondence, we present a subspace interpolation method for designing spatial precoders for all subcarriers by using the precoders known on pilot tones. The nonpilot precoders are solutions to a weighted least-squares design on the Grassmann manifold. Simulation results show performance benefits over existing MIMO-OFDM techniques.

关键词： closed-loop interpolation limited feedback multiple-input multiple-output (MIMO) systems orthogonal frequency-division multiplexing subspace coding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：