New Classes of Codes for Cryptologists and Computer Scientists

W. B. Vasantha Kandasamy; Florentin Smarandache

Home/Archive/arXiv

arXiv · 0801.2681

New Classes of Codes for Cryptologists and Computer Scientists

W. B. Vasantha Kandasamy·Florentin Smarandache

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this book, we have introduced several new classes of codes to aid cryptologists and computer scientists. We have explained these codes very non-technically so that a strong mathematical foundation is not needed to understand them. This book also provides an easy method to detect and correct errors that occur during transmission. Further, some of the codes are constructed so as to mislead an intruder/ hacker. False n-codes, whole n-codes can serve this pupose. These codes can be used to ensure security in networks and safe transmission of identity. We have named a few new classes of codes after Periyar, the south-Indian social leader, to mark his services to humanity. This book is divided into three chapters. Chapter one is introductory in nature. The notion of bicodes and their generalization, and n-codes are introduced in the second chapter. Periyar linear codes are introduced in the third chapter. We have used two methods, viz. pseudo best n-approximations and n-coset leader properties to detect and correct errors.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

W. B. Vasantha Kandasamy, Florentin Smarandache. 2008-01-17. New Classes of Codes for Cryptologists and Computer Scientists. https://arxiv.org/abs/0801.2681

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗