Filters








165,394 Hits in 2.9 sec

Design of Two Dimensional Unipolar (Optical) Orthogonal Codes Through One Dimensional Unipolar (Optical) Orthogonal Codes [article]

Ram Chandra Singh Chauhan , Rachna Asthana
2013 arXiv   pre-print
Representations of these 2D codes in difference of positions representation (DoPR) have also been discussed along-with conventional weighted positions representation (WPR) of the code.  ...  This paper also proposes less complex methods for calculation of auto-correlation as well as cross-correlation constraints within set of matrix codes.  ...  is an one dimensional code with code length n = LN and code weight 'one dimensional codes with maximum auto-correlation and cross-correlation constraint to be less than or equal to 'w-1', can be obtained  ... 
arXiv:1309.2254v1 fatcat:lqighzsoorhsxobsh6t65bxehu

LDPC Codes Over Rings for PSK Modulation

D. Sridhara, T.E. Fuja
2005 IEEE Transactions on Information Theory  
the additive white Gaussian noise (AWGN) channel demonstrates that this approach is a good alternative to bandwidth-efficient techniques based on binary LDPC codes-e.g., bit-interleaved coded modulation  ...  Specifically, LDPC codes are constructed over the integer rings and and mapped onto phase-shift keying (PSK)-type signal sets to yield geometrically uniform signal space codes.  ...  One of those optimal weight sets was , and the average entropy for this code is shown in the figure.  ... 
doi:10.1109/tit.2005.853330 fatcat:ym7qgi5od5ggfcmp3lyksv4ovm

Page 5116 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
Summary: “The theory of higher weights is applied to binary self-dual codes.  ...  Given a linear code @ and a cycle-free graph topology, there exists a well-defined minimal realization for @ on that graph in which each constraint is a linear code with a well-defined length and dimension  ... 

Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights

Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal
2007 IEEE Transactions on Information Theory  
We also present some bounds on pseudocodeword weight for p-ary LDPC codes.  ...  Treating these codes as p-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite-geometry LDPC codes  ...  By corresponding binary LDPC codes we mean the codes obtained by interpreting the given LDPC constraint graph as one representing a binary LDPC code. D.  ... 
doi:10.1109/tit.2007.892774 fatcat:elgcqejnojaf3eqmg7vogspxoe

Properties and constructions of constrained codes for DNA-based data storage

Kees A. Schouhamer Immink, Kui Cai
2020 IEEE Access  
We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance.  ...  We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines.  ...  The weight w of a binary sequence of length n is the sum of the runlengths of ones.  ... 
doi:10.1109/access.2020.2980036 fatcat:dgunp45sorf3pnnerwdzrfjdz4

Properties and constructions of constrained codes for DNA-based data storage [article]

Kees A. Schouhamer Immink, Kui Cai
2018 arXiv   pre-print
We show that the implementation of AT/GC-balanced codes is straightforward accomplished with binary balanced codes.  ...  We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance.  ...  In Section V, we enumerate the number of binary and quaternary sequences with combined weight and run-length constraints.  ... 
arXiv:1812.06798v1 fatcat:7ujgikmvcvhtfeimews4ydvyry

Weighted hashing for fast large scale similarity search

Qifan Wang, Dan Zhang, Luo Si
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
The hashing codes and their corresponding weights are jointly learned in a unified framework by simultaneously preserving the similarity between data examples and balancing the variance of each hashing  ...  An iterative coordinate descent optimization algorithm is designed to derive desired hashing codes and weights.  ...  In this way, the binary code achieves the best balance and the bit balance constraint Y 1 Y 1 Y 1 = 0 in Eqn.5 can also be satisfied.  ... 
doi:10.1145/2505515.2507851 dblp:conf/cikm/WangZS13 fatcat:biov6rjhrrditd2v4qjdymhyli

Page 796 of Mathematical Reviews Vol. , Issue 81B [page]

1981 Mathematical Reviews  
(n,d, w) of codewords in a binary code of length n, constant weight w and minimum distance d.”  ...  The results of MacWilliams are used in deriving the formulae. Bal Kishan Dass (Delhi) Tairyan, V. I. [Tairjan, V. 1. Weight spectra of some classes of binary cyclic codes.  ... 

Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [article]

Christine Kelley, Deepak Sridhara, Joachim Rosenthal
2006 arXiv   pre-print
We also present some bounds on pseudocodeword weight for p-ary LDPC codes.  ...  Treating these codes as p-ary LDPC codes rather than binary LDPC codes improves their rates, minimum distances, and pseudocodeword weights, thereby giving a new importance to the finite geometry LDPC codes  ...  By corresponding binary LDPC codes, we mean the codes obtained by interpreting the given LDPC constraint graph as one representing a binary LDPC code.  ... 
arXiv:cs/0510009v2 fatcat:jwxiqhje6ncqjitrsurvg3a73y

Learning to Rank Binary Codes [article]

Jie Feng, Wei Liu, Yan Wang
2014 arXiv   pre-print
To address both issues, in this paper we propose a flexible bitwise weight learning framework based on the binary codes obtained by state-of-the-art hashing methods, and incorporate the learned weights  ...  Extensive experimental results demonstrate significant performance gains of using binary codes with bitwise weighting in image retrieval tasks.  ...  Binary Code Bases: We select several hashing methods to produce base binary codes on which our weight learning is applied.  ... 
arXiv:1410.5524v1 fatcat:qxgnbe3qmvbnleyoli3mpu5kyu

On the typical minimum distance of protograph-based non-binary LDPC codes

Dariush Divsalar, Lara Dolecek
2012 2012 Information Theory and Applications Workshop  
Using recently obtained ensemble weight enumerators for the PB NB LDPC codes, we show that asymptotically in the code length N , the entries in the weight enumerators up to some weight d * = δ * N (δ *  ...  Results of this type advance the understanding of structured non-binary LDPC codes.  ...  Novel code design based on non-binary LDPC protographs was recently discussed in [4] and [19] .  ... 
doi:10.1109/ita.2012.6181802 dblp:conf/ita/DivsalarD12 fatcat:xoa5weqkhbdrvcuy2y3iodpsfq

Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem [chapter]

Felix Streichert, Holger Ulmer, Andreas Zell
2004 Lecture Notes in Computer Science  
In financial engineering the problem of portfolio selection has drawn much attention in the last decades.  ...  But still unsolved problems remain, while on the one hand the type of model to use is still debated, even the most common models cannot be solved efficiently, if real world constraints are added.  ...  Fig. 3 . 0 Fig. 5 . 305 ∆area for the experiments on the Hang Seng data set li = 0 and ci = 0 (1: GA binary-coding, 2: GA gray-coding, 3: GA real-valued, 4: KGA binary-coding, 5: KGA gray-coding, 6: KGA  ... 
doi:10.1007/978-3-540-24855-2_131 fatcat:5mxdamae3jajzmckkx3s7jxzgi

Page 3146 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
Earlier work has fo- cused more on block codes for specific modulation constraints.  ...  While our treatment is completely general, we focus on finite-state codes for maximum transition run (MTR) constraints.  ... 

Minimal residual ordinal loss hashing with an adaptive optimization mechanism

Zhen Wang, Fuzhen Sun, Longbo Zhang, Pingping Liu
2020 EURASIP Journal on Image and Video Processing  
The binary coding technique has been widely used in approximate nearest neighbors (ANN) search tasks.  ...  When the algorithm converges, the binary codes and bitwise weights can be well adaptive to each other.  ...  In contrast, we demand binary codes and bitwise weights should satisfy the ordinal relation preserving constraint defined based on quartic samples as in Eq. (1).  ... 
doi:10.1186/s13640-020-00497-4 fatcat:w2bbtzk2pjhyxgkf7hlix4zmuq

Pseudocodeword weights for non-binary LDPC codes

Christine Kelley, Deepak Sridhara, Joachim Rosenthal
2006 2006 IEEE International Symposium on Information Theory  
The tree-based lower bounds on the minimum pseudocodeword weight are shown to also hold for q-ary LDPC codes on these channels.  ...  Pseudocodewords of q-ary LDPC codes are examined and the weight of a pseudocodeword on the q-ary symmetric channel is defined.  ...  Then the minimum pseudocodeword weight w min on the q-ary symmetric channel is lower bounded as w min ≥ T (d, g) Single constraint code.  ... 
doi:10.1109/isit.2006.262072 dblp:conf/isit/KelleySR06 fatcat:o2wmymxos5ai7g6ukpbhh4ic4y
« Previous Showing results 1 — 15 out of 165,394 results