2012 National Conference on Communications (NCC)最新文献_第7页

On t-designs and bounds relating query complexity to error resilience in locally correctable codes 局部可纠错码中查询复杂度与错误弹性的t-设计和边界

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176752

V. Lalitha, N. Prakash, G. Kamath, P. V. Kumar

{"title":"On t-designs and bounds relating query complexity to error resilience in locally correctable codes","authors":"V. Lalitha, N. Prakash, G. Kamath, P. V. Kumar","doi":"10.1109/NCC.2012.6176752","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176752","url":null,"abstract":"An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131981084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection 点对点信道码率选择的离散时间批处理服务队列延迟最优调度

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176741

V. Sukumaran, U. Mukherji

{"title":"Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection","authors":"V. Sukumaran, U. Mukherji","doi":"10.1109/NCC.2012.6176741","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176741","url":null,"abstract":"We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Underwater acoustic communications: Design considerations at the physical layer based on field trials 水声通信:基于现场试验的物理层设计考虑

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176782

B. Sameer, R. D. Koilpillai, P. MuraliKrishna

引用次数: 6

Pronunciation variation across different dialects for English: A syllable-centric approach 英语不同方言的发音差异:以音节为中心的方法

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176740

R. G. Brunet, H. Murthy

引用次数: 2

An investigation into traffic analysis for diverse data applications on smartphones 智能手机上各种数据应用的流量分析调查

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176903

S. Baghel, K. Keshav, V. R. Manepalli

{"title":"An investigation into traffic analysis for diverse data applications on smartphones","authors":"S. Baghel, K. Keshav, V. R. Manepalli","doi":"10.1109/NCC.2012.6176903","DOIUrl":"https://doi.org/10.1109/NCC.2012.6176903","url":null,"abstract":"Present day smartphones like iPhone and Andriod based phones have lead to explosive growth in traffic over cellular networks. The growth has occurred both in volume and diversity in terms of traffic characteristics. Among the different types of traffic, there is prominent increase in background type of data due to popularity of applications like Facebook, Skype, Email clients etc which keeps exchanging data with corresponding server, even when the user is not actively using the application. In order to save power consumption of smart phones and for optimal allocation of resources to deserving phones in network by minimum possible signaling traffic, 3GPP LTE specifications have defined mechanisms like connected mode DRX (Discontinuous Reception) which offers two stage of sleep in form of long & short DRX. Since such diverse type of applications are running in smartphone, this work attempts to investigate traffic characteristics of popular applications in Andriod based smartphones. Due to various reasons, such applications, keep consuming precious bandwidth and battery even when not in active use. Main emphasis is thus provided to study the characteristic of these applications when they are running without user intervention. Since, the diverse range of data characteristics is assumed to be causing drain in User Equipment (UE) battery and overhead in NW signaling, we expect that this investigation would help in developing appropriate new power saving mechanisms in future releases of cellular networks.","PeriodicalId":178278,"journal":{"name":"2012 National Conference on Communications (NCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122097730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 34

Analysis of modified microstrip line and its application 改进微带线的分析及其应用

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176769

D. Packiaraj, M. Ramesh, A. T. Kalghatgi, K. Vinoy

引用次数: 6

Malicious user suppression for cooperative spectrum sensing in cognitive radio networks using Dixon's outlier detection method 基于Dixon离群值检测的认知无线电网络协同频谱感知恶意用户抑制

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176787

S. Kalamkar, A. Banerjee, A. Roychowdhury

引用次数: 33

Automatic detection of visual defects in image intensifiers 图像增强器中视觉缺陷的自动检测

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176796

M. Kamalapriya, V. Thilagavathi

引用次数: 0

Queue stability measurements for Energy Harvesting Sensor nodes 能量采集传感器节点的队列稳定性测量

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176745

V. Prashanth, T. V. Prabhakar, K. Prakruthi, H. Jamadagni

引用次数: 3

Testbed based throughput analysis in a Wireless Sensor Network 基于试验台的无线传感器网络吞吐量分析

2012 National Conference on Communications (NCC) Pub Date : 2012-04-03 DOI: 10.1109/NCC.2012.6176804

A. Kumar, P. G. Namboothiri, S. Deshpande, S. Vidhyadharan, K. Sivalingam, S. S. Murty

引用次数: 16