Is The Burden of Medical Education Affecting Ethics of Medical Treatment?

A substantial number of medical students in India have to bear an enormous financial burden for earning a bachelor's degree in medicine referred to as MBBS (bachelor of medicine and bachelor of surgery). This degree program lasts for four and one-half years followed by one year of internship. A postgraduate degree, such as MD, has to be pursued separately on completion of a MBBS. Every medical college in India is part of a hospital where the medical students get clinical exposure during the course of their study. All or at least a number of medical colleges in a given state are affiliated to a university that mainly plays a role of an overseeing authority. The medical colleges usually have no official interaction with other disciplines of education such as science and engineering, perhaps because of their independent location and absence of emphasis on medical research. However, many of the medical colleges are adept in imparting high-quality and sound training in medical practices including diagnostics and treatment. The medical colleges in India are generally of two types, i.e., government owned and private. Since only a limited number of seats are available across India in the former category of colleges, only a small fraction of aspiring candidates can find admission in these colleges after performing competitively in the relevant entrance tests. A major advantage of studying in these colleges is the nominal tuition fees that have to be paid. On the other hand, a large majority of would-be medical graduates have to seek admission in the privately run medical institutes in which the tuition and other related fees can be mind boggling when compared to their public counterparts. Except for candidates of exceptionally affluent background, the only alternative for fulfilling the dream of becoming a doctor is by financing one's study through hefty bank loans that may take years to pay back. It is often heard from patients that they are asked by doctors to undergo a plethora of diagnostic tests for apparently minor illnesses, which may financially benefit those prescribing the tests. The present paper attempts to throw light on the extent of disparity in cost of a medical education between state-funded and privately managed medical colleges in India; the average salary of a new medical graduate, which is often ridiculously low when compared to what is offered in entry-level engineering and business jobs; and the possible repercussions of this apparently unjust economic situation regarding the exploitation of patients.

Upper Bounds on the Size of Grain-Correcting Codes

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

OPTIMALITY OF THE PRODUCT-MATRIX CONSTRUCTION FOR SECURE MSR REGENERATING CODES

In this paper, we consider the security of exact-repair regenerating codes operating at the minimum-storage-regenerating (MSR) point. The security requirement (introduced in Shah et. al.) is that no information about the stored data file must be leaked in the presence of an eavesdropper who has access to the contents of l(1) nodes as well as all the repair traffic entering a second disjoint set of l(2) nodes. We derive an upper bound on the size of a data file that can be securely stored that holds whenever l(2) <= d - k +1. This upper bound proves the optimality of the product-matrix-based construction of secure MSR regenerating codes by Shah et. al.

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

While the tradeoff between the amount of data stored and the repair bandwidth of an (n, k, d) regenerating code has been characterized under functional repair (FR), the case of exact repair (ER) remains unresolved. It is known that there do not exist ER codes which lie on the FR tradeoff at most of the points. The question as to whether one can asymptotically approach the FR tradeoff was settled recently by Tian who showed that in the (4, 3, 3) case, the ER region is bounded away from the FR region. The FR tradeoff serves as a trivial outer bound on the ER tradeoff. In this paper, we extend Tian's results by establishing an improved outer bound on the ER tradeoff which shows that the ER region is bounded away from the FR region, for any (n; k; d). Our approach is analytical and builds upon the framework introduced earlier by Shah et. al. Interestingly, a recently-constructed, layered regenerating code is shown to achieve a point on this outer bound for the (5, 4, 4) case. This represents the first-known instance of an optimal ER code that does not correspond to a point on the FR tradeoff.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

On the Bounds of Certain Maximal Linear Codes in a Projective Space

The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) + dim(Y)-2dim(X boolean AND Y) defined on P-q(n) turns it into a natural coding space for error correction in random network coding. A subset of P-q(n) is called a code and the subspaces that belong to the code are called codewords. Motivated by classical coding theory, a linear coding structure can be imposed on a subset of P-q(n). Braun et al. conjectured that the largest cardinality of a linear code, that contains F-q(n), is 2(n). In this paper, we prove this conjecture and characterize the maximal linear codes that contain F-q(n).