1,281,905 Hits in 3.3 sec

Near orders and codes [article]

C. Carvalho, C. Munuera, E. Silva, F. Torres
2006 arXiv   pre-print
Hoholdt, van Lint and Pellikaan used order functions to construct codes by means of Linear Algebra and Semigroup Theory only.  ...  In this paper we introduce the concept of near order function with the aim of generalize this approach in such a way that a of wider family of Geometric Goppa codes can be studied on a more elementary  ...  Normalized Near Orders and Near Weights Functions. Let ρ be a n-order function on R.  ... 
arXiv:cs/0603014v1 fatcat:iqzkfsy5e5c5bmozi63lybicvy

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments

Harri Haanp��, Petteri Kaski
2005 Designs, Codes and Cryptography  
In this paper we introduce a correspondence between near resolvable 2-(v, k, λ) designs and a particular class of codes.  ...  The near resolvable 2-(13, 4, 3) designs are classified by classifying the corresponding codes with an orderly algorithm.  ...  Acknowledgements The authors wish to thank Clement Lam and PatricÖstergård for discussions and numerous helpful comments.  ... 
doi:10.1007/s10623-003-6738-7 fatcat:uf2sh7d6v5eoxk2rbi4oo3u2yu

Integrated lossy, near-lossless, and lossless compression of medical volumetric data

Sehoon Yea, Sungdae Cho, William A. Pearlman, Amir Said, John G. Apostolopoulos
2005 Image and Video Communications and Processing 2005  
of near-lossless coding.  ...  We propose an integrated, wavelet based, two-stage coding scheme for lossy, near-lossless and lossless compression of medical volumetric data.  ...  to become at most as good as and usually worse than that of first-order entropy coding.  ... 
doi:10.1117/12.585931 dblp:conf/eiivcp/YeaCP05 fatcat:uuy3li2msrfbnbuufr3zenapey

Lossless and near-lossless source coding for multiple access networks

Qian Zhao, M. Effros
2003 IEEE Transactions on Information Theory  
The interest in near-lossless codes is inspired by the discontinuity in the limiting rate region at ( ) = 0 and the resulting performance benefits achievable by using near-lossless MASCs as entropy codes  ...  A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences =1 and =1 is drawn independent and identically distributed  ...  ACKNOWLEDGMENT The authors gratefully acknowledge the detailed critiques and many helpful comments from the anonymous reviewers.  ... 
doi:10.1109/tit.2002.806145 fatcat:gmd3xrik4nctpoi2iwjtq5obki

Context-based lossless and near-lossless compression of EEG signals

N. Memon, Xuan Kong, J. Cinkler
1999 IEEE Transactions on Information Technology in Biomedicine  
A variety of lossless compression techniques, including compress, gzip, bzip, shorten, and several predictive coding methods, are investigated and compared.  ...  It is seen that compression ratios obtained by lossless compression are limited even with sophisticated context-based bias cancellation and activity-based conditional coding.  ...  Figure 3 gives results after bias cancellation was added to the two predictive coding techniques: first order predictor and sixth order AR predictor.  ... 
doi:10.1109/4233.788586 pmid:10719487 fatcat:lapikpkcknhwdbfbm7mbmiglsy

Avoiding stability-induced inefficiencies in BDF methods

Kris Stewart
1990 Journal of Computational and Applied Mathematics  
For certain classes of problems, the Backward Differentiation Formulas (BDF) are often dismissed due to their poor stability behavior near the imaginary axis for orders three and above.  ...  We explain why and for what problems this happens, what the appropriate tactic should be, and why this is not the tactic taken by most automatic codes.  ...  The difficulty We examine the behavior of a collection of codes on a problem which is stiff and which has a pair of eigenvalues near the imaginary axis.  ... 
doi:10.1016/0377-0427(90)90017-t fatcat:j3xclswuovh5jfkrjrjyz5v7ee

On the Performance of Short Forward Error-Correcting Codes

Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Li Ping, Baoming Bai
2007 IEEE Communications Letters  
Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes.  ...  Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively.  ...  ACKNOWLEDGMENT The first author is grateful for the great help from Keying Wu and Jing Jiang. We would also like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/lcomm.2007.070746 fatcat:rcxhigccqre7pp66b6qefyclri

Near-lossless image compression techniques

Nasir Memon
1998 Journal of Electronic Imaging (JEI)  
A procedure for near-lossless compression using a modification of lossless predictive coding techniques to satisfy the specified tolerance is described.  ...  Simulation results with modified versions of two of the best lossless predictive coding techniques known, CALIC and JPEG-LS, are provided.  ...  We are grateful to Amir Said and William Pearlman for making the ''Progcode'' package available on the Web.  ... 
doi:10.1117/1.482591 fatcat:xo5itpzv2rbwdikcju5xth6vga


A. Lakehal, A. Boua
2018 International Journal of Applied Mathematics  
Therefore, an algorithm of a program to compute the incidence matrix plays a very important role in encrypting and decrypting images.  ...  The purpose of this article is to indicate the importance of using close planar rings in the construction of high efficiency balanced incomplete block (BIBD) plans, and how these can be used to encrypting  ...  Introduction and motivation Near-rings are one of the generalized structures of rings. The study and research on near-rings is very systematic and continuous.  ... 
doi:10.12732/ijam.v31i2.9 fatcat:q6cvdnnianapvbgpzr6ptr6fhu

A Wavelet-Based Two-Stage Near-Lossless Coder

S. Yea, W.A. Pearlman
2006 IEEE Transactions on Image Processing  
It is in the spirit of "lossy plus residual coding" and consists of a wavelet-based lossy layer followed by an arithmetic coding of the quantized residual to guarantee a given L ∞ error bound in the pixel  ...  In this paper,we investigate a two-stage near-lossless compression scheme.  ...  Furthermore, since prediction-based coders are very competitive in lossless and high bit-rate coding, it is expected to be so in many near-lossless coding scenarios, where the maximum pixel-domain error  ... 
doi:10.1109/tip.2006.877525 pmid:17076407 fatcat:2vaxgx4zh5dtlfjfrdvw6npk6i

Crick Wobble and Superwobble in Standard Genetic Code Evolution

Michael Yarus
2021 Journal of Molecular Evolution  
But wobble cannot appear too soon, or it will inhibit encoding and more decisively, obstruct evolution of full coding tables.  ...  Superwobble translates NN U/C/A/G codons, using one adaptor RNA with an unmodified 5′ anticodon U (appropriate to earliest coding) in modern mitochondria, plastids, and mycoplasma.  ...  Then, at any time within the era when nascent codes most resemble the near-universal genetic code-and whatever assignment accuracy was required to meet that selection-and whether SGC-like order or literal  ... 
doi:10.1007/s00239-020-09985-7 pmid:33409542 fatcat:tnyinl3a5jbcnmdex333f5r5c4

filou oscillation code

J. C. Suárez, M. J. Goupil
2007 Astrophysics and Space Science  
In particular, FILOU calculates (in a perturbative approach) adiabatic oscillation frequencies corrected for the effects of rotation (up to the second order in the rotation rate) including near degeneracy  ...  The present paper provides a description of the oscillation code FILOU, its main features, type of applications it can be used for, and some representative solutions.  ...  Acknowledgements JCS acknowledges support at the Instituto de Astrofísica de Andalucía (CSIC) by an I3P contract financed by the European Social Fund and also acknowledges support from the Spanish Plan  ... 
doi:10.1007/s10509-007-9568-7 fatcat:epeo3bjhhjbhri5a4lhfzehgau

Page 1448 of Mathematical Reviews Vol. 52, Issue 4 [page]

1976 Mathematical Reviews  
He also notes that the Reed-Solomon code of word length n defined over GF(q) and having minimum distance n—k is a kth order near-orthogonal code meeting this bound.  ...  S. kth-order near-orthogonal codes. IEEE Trans. Information Theory IT-17 (1971), 116-117.  ... 

Nanophotonic Hierarchical Holograms: Demonstration of Hierarchical Applications Based on Nanophotonics [chapter]

Naoya Tate, Makoto Naruse, Takashi Yatsui, Tadashi Kawazoe, Morihisa Hoga, Yasuyuki Ohyagi, Yoko Sekine, Tokuhiro Fukuyama, Mitsuru Kitamura, Motoichi Ohtsu
2011 Holograms - Recording Materials and Applications  
In order to evaluate this recognizability, here we define a numerical figure-of-merit num R as code num code env I RI I =× , (1) which yields a higher value with higher contrast with respect to code I  ...  To embed the nanometric structures, the grid structures were partially modified in order to implement the nanophotonic codes.  ... 
doi:10.5772/18787 fatcat:zbialrtwfjfydayswzscq3vdo4

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions [chapter]

Inna Polak, Adi Shamir
2014 Lecture Notes in Computer Science  
The eciency of both Lamberger's and Leurent's algorithms depend on the quality of their error correction code.  ...  As we show in this paper, this is a suboptimal choice, which can be considerably improved by using randomly chosen linear codes instead of Hamming codes and storing a precomputed lookup table to make the  ...  secondary order).  ... 
doi:10.1007/978-3-319-13039-2_13 fatcat:p6thfxqmtzf45dqo4kqfx42adu
« Previous Showing results 1 — 15 out of 1,281,905 results