Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
772,747
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
On the Existence of Optimal (v, 5, 1) and (v, 6, 1) Binary Cyclically Permutable Constant-Weight Codes
The problem of the existence of optimal (v,k,1) binary cyclically permutable constant-weight (CPCW) codes has been completely solved for codeword weights k<5. We consider the smallest open cases, namely k=5 and k=6. We present such codes for small values of the code length v and derive necessary conditions for the existence of optimal (k(k−1)t+2,k,1) CPCW codes. These necessary conditions can be used to construct such codes, as well as to show that optimal codes with some parameters do not exist. In particular, we use them to prove that an optimal (92,6,1) CPCW code does not exist.
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
Decoding of the extended Golay code by the simplified successive-cancellation list decoder adapted to multi-kernel polar codes
Keywords: Binary linear block code Coding theory Error-correcting code Golay code Multi-kernel polar code ABSTRACT This paper describes an adaptation of a polar code decoding technique in favor of the extended Golay code. When the positions of the frozen bits are fixed to 0, and the source information bits are organized in the remaining positions, to form the source vector u. The source codeword x is obtained via the encoding process applied on u by: x = u ¦ Gp, so that Gp is the kronecker product of order log2 (JV) of the Arikan kernel, as a generator matrix of P. The SC approach, which can be described as a binary tree, as the first polar decoding algorithm developed. Because no frozen bit nodes are providing prior information, traversing subtree yields no additional information. [...]it is sufficient to estimate the leaf bits at the current node. c) Repetition (REP) node: it is the root node of a subtree, with all leaf nodes, are frozen except the last node which is an information bit node as illustrated in Figure 2. d) Single parity check (SPC) node: the root node of a subtree whose leaf nodes are all information bit nodes except the first, which is a frozen bit node corresponds to the SPC node as illustrated in Figure 2.
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
Code deformation and lattice surgery are gauge fixing
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realized in the near term, uses stabilizer codes which can be embedded in a planar layout. The set of fault-tolerant operations which can be executed in these systems using unitary gates is typically very limited. This has driven the development of measurement-based schemes for performing logical operations in these codes, known as lattice surgery and code deformation. In parallel, gauge fixing has emerged as a measurement-based method for performing universal gate sets in subsystem stabilizer codes. In this work, we show that lattice surgery and code deformation can be expressed as special cases of gauge fixing, permitting a simple and rigorous test for fault-tolerance together with simple guiding principles for the implementation of these operations. We demonstrate the accuracy of this method numerically with examples based on the surface code, some of which are novel.
Journal Article