Báo cáo toán học: "Covering Codes for Hats-on-a-line" pot

... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection EURASIP ... Hayar, M Turki, Distribution discontinuities detection using algebraic technique for spectrum sensing in cognitive radio networks, 5th International Conference on Cog...

Ngày tải lên: 20/06/2014, 20:20

... considered in this study. In Section 3, we introduce the approaches to analyze video 3 Resource reservation for mobile hotspots in vehicular envi- ronments with cellular/WLAN interworking Wei Song Faculty ... made available soon. Resource reservation for mobile hotspots in vehicular environments with cellular/WLAN interworking EURASIP Journal on Wire...

Ngày tải lên: 20/06/2014, 20:20

... (support code 9 Resource Allocation for Asymmetric Multi-Way Relay Com- munication over Orthogonal Channels Christoph Hausl 1 , Onurcan Iáscan 1 and Francesco Rossetto 2 1 Institute for Communications ... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Resource Allocation for Asymmetric Multi-Way Relay...

Ngày tải lên: 20/06/2014, 20:20

... view on the first 10 years of CR. More specifically of the different challenges faced by the CR decision making community and the suggested solution to answer them. We state that most of these decision ... upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Decision making for cognitive radio equipment: analysis...

Ngày tải lên: 20/06/2014, 20:20

... new method for parameter estimation of multicomponent LFM signal based on sparse signal representation, in Proceedings of IEEE International Conference on Information and Automation, Zhangjiajie, ... signatures for target recognition. However, it’s a huge challenge for micromotion parameter estimation in SAR, since (1) micromotion- target signals are hard to...

Ngày tải lên: 20/06/2014, 20:20

... (HTML) versions will be made available soon. Biorefinery process for protein extraction from oriental mustard (Brassica juncea (L.) Czern.) using ethanol stillage AMB Express 2012, 2:5 doi:10.1186/2191-0855-2-5 Kornsulee ... lysine from protein product extracted with TS and NaCl solution were similar at 43.0 ± 0.3% and 42.0 ± 0.4%, respectively (Table 4)....

Ngày tải lên: 20/06/2014, 20:20

... height of the display). For quality assessments, we decided not to use the recommended continuous assessment method for long video sequences, since quality evaluation tasks may 2 Quality assessment ... text (HTML) versions will be made available soon. Quality assessment for mobile media-enriched services: impact of video lengths Communications in Mobile...

Ngày tải lên: 20/06/2014, 21:20

... that f(t) is strictly increasing in [1, +∞). 9 Sharp bounds for Seiffert mean in terms of root mean square Yu-Ming Chu ∗1 , Shou-Wei Hou 2 and Zhong-Hua Shen 2 1∗ Department of Mathematics, Huzhou ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/i...

Ngày tải lên: 20/06/2014, 21:20

... a probabilistic framework for opportunistic spectrum management in cognitive ad hoc networks that optimizes the constrained cognitive user goodput while taking the unavoidable inaccuracy of spectrum ... Access Probabilistic framework for opportunistic spectrum management in cognitive ad hoc networks Ahmed Khattab * , Dmitri Perkins and Magdy A Bayou...

Ngày tải lên: 20/06/2014, 21:20

... on a Gray code for F(n; A R ). We actually construct Gray codes for the set H(n; C), thus implying Gray codes for F(n)=H(n; ). As in Section 4, the construction of Gray codes for H(n; C)has three ... Gray codes for H(n; C)whenn ≤ m are constructed in Section A.1. Gray codes for the latter two stagesaredescribedinSectionA.2. A.1 Gray codes when n ≤ m In this section, w...

Ngày tải lên: 07/08/2014, 06:20

... appear. [2]G.D.Cohen,I.Honkala,S.LitsynandA.Lobstein:Covering Codes, Elsevier, 1997. [3] M.G.Karpovsky,K.ChakrabartyandL.B.Levitin: Onanewclassofcodes for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, ... vertex of degree zero. Since, by symmetry, one element in C  2 produces two vertices with degree zero or New Bounds for Codes Identifying Vertices...

Ngày tải lên: 07/08/2014, 06:20

... Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted. [4] I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some in nite regular ... Lobstein, G. Z´emor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999. [7] G. Cohen, I. Honkala, A....

Ngày tải lên: 07/08/2014, 06:22

... to two optimization problems related to covering codes in which one leads to an exact solution (for binary codes) . For instance, we show that for 0 <k<n,(n − k − d) ≤ α m n where d = t(n ... straightforward. x 1 calls out the value Y 2 =(  n i=2 y i )modm.Foreachi>1, x i ◦ can see the values y i+1 , ,y n ◦ has heard the values Y 2 and y 2 , ,y i−1 and therefore uses the exp...

Ngày tải lên: 07/08/2014, 13:21

... (i) and (iv) P 3 ∩ P 4 = {x} with x ∈ Z 6 . Let R denote a set the electronic journal of combinatorics 16 (2009), #R133 5 Lower Bounds for q-ary Codes with Large Covering Radius Wolfga ng Haas Immanuel ... the case k = 5. For k > 5 the computational effort became too la r ge for a systematical treatment. Here we got only a few sporadic new bounds: six bounds for k...

Ngày tải lên: 08/08/2014, 01:20

... electronic journal of combinatorics 17 (2010), #R122 6 References [1] Ir`ene Charon, Iiro Honkala, Olivier Hudry, and Antoine Lobstein. General bounds for identifying codes in some in nite regular graphs. ... of density in certain in nite graphs which are locally finite. We present new lower bounds for densities of codes for some sm all values of r in both the squa...

Ngày tải lên: 08/08/2014, 12:22