Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
808,354
result(s) for
"Code"
Sort by:
Life's greatest secret : the race to crack the genetic code
Life's Greatest Secret is the story of the discovery and cracking of the genetic code. This great scientific breakthrough has had far-reaching consequences for how we understand ourselves and our place in the natural world. The code forms the most striking proof of Darwin's hypothesis that all organisms are related, holds tremendous promise for improving human well-being, and has transformed the way we think about life. Matthew Cobb interweaves science, biography and anecdote in a book that mixes remarkable insights, theoretical dead-ends and ingenious experiments with the pace of a thriller. He describes cooperation and competition among some of the twentieth-century's most outstanding and eccentric minds, moves between biology, physics and chemistry, and shows the part played by computing and cybernetics. The story spans the globe, from Cambridge MA to Cambridge UK, New York to Paris, London to Moscow. It is both thrilling science and a fascinating story about how science is done.
Book
The minimum locality of linear codes
Locally recoverable codes (LRCs) were proposed for the recovery of data in distributed and cloud storage systems about nine years ago. A lot of progress on the study of LRCs has been made by now. However, there is a lack of general theory on the minimum locality of linear codes. In addition, the minimum locality of many known families of linear codes has not been studied in the literature. Motivated by these two facts, this paper develops some general theory about the minimum locality of linear codes, and investigates the minimum locality of a number of families of linear codes, such as
q
-ary Hamming codes,
q
-ary Simplex codes, generalized Reed-Muller codes, ovoid codes, maximum arc codes, the extended hyperoval codes, and near MDS codes. Many classes of both distance-optimal and dimension-optimal LRCs are presented in this paper. To this end, the concepts of linear locality and minimum linear locality are specified. The minimum linear locality of many families of linear codes are settled with the general theory developed in this paper.
Journal Article
The genetic code
This book tracks the key experiments and discoveries that set in motion efforts to crack the code and explores the many ways humans have applied knowledge of the genetic code to alter gene activity.
Book
A class of negacyclic BCH codes and its application to quantum codes
In this paper, we study negacyclic BCH codes over Fq of length n=(q2m-1)/(q-1) , where q is an odd prime power and m is a positive integer. In particular, the dimension, the minimum distance and the weight distribution of some negacyclic BCH codes over Fq of length n=(q2m-1)/(q-1) are determined. Two classes of negacyclic BCH codes meeting the Griesmer bound are obtained. As an application, we construct quantum codes with good parameters from this class of negacyclic BCH codes.
Journal Article
Three-word codes a,aba,u and a,ab,v having finite completions
Does every three-word code have a finite completion? Up to now, this famous question in the theory of codes remains open. Motivated by this problem, we construct several types of three-word codes with the form a,aba,u and a,ab,v which have finite completions.
Journal Article
Algorithms in Low-Code-No-Code for Research Applications: A Practical Review
Algorithms have evolved from machine code to low-code-no-code (LCNC) in the past 20 years. Observing the growth of LCNC-based algorithm development, the CEO of GitHub mentioned that the future of coding is no coding at all. This paper systematically reviewed several of the recent studies using mainstream LCNC platforms to understand the area of research, the LCNC platforms used within these studies, and the features of LCNC used for solving individual research questions. We identified 23 research works using LCNC platforms, such as SetXRM, the vf-OS platform, Aure-BPM, CRISP-DM, and Microsoft Power Platform (MPP). About 61% of these existing studies resorted to MPP as their primary choice. The critical research problems solved by these research works were within the area of global news analysis, social media analysis, landslides, tornadoes, COVID-19, digitization of process, manufacturing, logistics, and software/app development. The main reasons identified for solving research problems with LCNC algorithms were as follows: (1) obtaining research data from multiple sources in complete automation; (2) generating artificial intelligence-driven insights without having to manually code them. In the course of describing this review, this paper also demonstrates a practical approach to implement a cyber-attack monitoring algorithm with the most popular LCNC platform.
Journal Article
Naming the world : language and power among the Northern Arapaho
\"An accessible, linguistics-focused account of language teaching, learning, and change in a Native American community\"--Provided by publisher.
Book
A new construction of linear codes with one-dimensional hull
The hull of a linear code C is the intersection of C with its dual C⊥ . The hull with low dimensions gets much interest due to its crucial role in determining the complexity of algorithms for computing the automorphism group of a linear code and for checking permutation equivalence of two linear codes. The hull of linear codes has recently found its application to the so-called entanglement-assisted quantum error-correcting codes (EAQECCs). In this paper, we provide a new method to construct linear codes with one-dimensional hull. This construction method improves the code lengths and dimensions of the recent results given by the author. As a consequence, we derive several new classes of optimal linear codes with one-dimensional hull. Some new EAQECCs are presented.
Journal Article